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 17, 2026 14:05Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 14:15073,769,86462,944,0001,108,0002,113,536expected "53684246705250463 ", got "53684244401250463 "
2May 17, 2026 14:157,69673,119,67363,885,00002,113,536
3May 17, 2026 14:157,69973,331,91962,871,0001,035,0002,113,536
4May 17, 2026 14:157,70073,386,09563,912,00002,113,536
5May 17, 2026 14:157,70071,830,27362,884,0001,033,0002,113,536
6May 17, 2026 14:157,70272,441,66162,886,0001,045,0002,113,536
7May 17, 2026 14:157,70271,567,82362,884,0001,045,0002,113,536
8May 17, 2026 14:157,70272,252,66862,888,0001,042,0002,113,536
9May 17, 2026 14:157,71074,204,43362,990,0001,003,0002,113,536