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 listMay 4, 2026 12:27caandocaandoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 12:28055,307,73437,391,0001,042,0002,469,888expected "53684567350226078 ", got "53684568681898063 "
2May 4, 2026 12:284,56556,822,76336,836,0001,055,0002,473,984
3May 4, 2026 12:284,57457,400,21436,933,0001,039,0002,469,888
4May 4, 2026 12:284,60557,286,50537,190,0001,039,0002,469,888
5May 4, 2026 12:284,60757,053,52537,203,0001,041,0002,469,888
6May 4, 2026 12:284,60855,609,72237,217,0001,036,0002,482,176
7May 4, 2026 12:284,61753,241,69737,288,0001,036,0002,473,984
8May 4, 2026 12:284,64757,728,45537,535,0001,038,0002,465,792
9May 4, 2026 12:284,67453,268,83937,759,0001,039,0002,469,888