Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJan 7, 2024 14:57Evgeniy AsvatovEvgeniy AsvatovScore: 334,839Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2024 14:57334,2372,842,640,5862,774,163,49202,191,360
2Jan 7, 2024 14:11334,2952,832,040,0792,774,645,06302,191,360
3Jan 7, 2024 14:55334,4262,840,464,6782,775,732,67702,207,744
4Jan 7, 2024 14:55334,5542,831,681,5682,776,795,34902,207,744
5Jan 7, 2024 14:11334,8392,842,597,0312,779,164,43902,260,992
6Jan 7, 2024 14:57334,9712,846,497,5142,780,261,45602,203,648
7Jan 7, 2024 14:55335,6332,836,972,0012,785,751,08102,203,648
8Jan 7, 2024 14:57335,6422,859,031,6962,785,827,13602,256,896
9Jan 7, 2024 14:11349,5712,961,025,5742,901,438,43702,199,552