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 12, 2026 03:16Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 03:16039,768,44831,418,0001,058,0002,113,536expected "53687587550798600 ", got "53687586912597527 "
2May 12, 2026 03:16041,352,02031,465,0001,155,0002,113,536expected "53685081861449587 ", got "53685299857238880 "
3May 12, 2026 03:163,89540,813,44331,261,0001,073,0002,113,536
4May 12, 2026 03:163,89840,189,67031,279,0001,081,0002,113,536
5May 12, 2026 03:163,90141,533,39431,301,0001,082,0002,113,536
6May 12, 2026 03:163,90142,827,47431,303,0001,082,0002,113,536
7May 12, 2026 03:163,92240,308,82831,481,0001,074,0002,113,536
8May 12, 2026 03:163,95040,115,02731,719,0001,073,0002,113,536
9May 12, 2026 03:163,99540,839,00132,070,0001,094,0002,113,536