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 15, 2026 23:22Victor MerckléVictor MerckléScore: 6,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 23:226,94966,359,51456,642,0001,040,0002,113,536
2May 15, 2026 23:226,95167,166,82057,699,00002,113,536
3May 15, 2026 23:226,95365,631,91356,692,0001,018,0002,113,536
4May 15, 2026 23:226,95366,462,87656,709,0001,003,0002,113,536
5May 15, 2026 23:226,95568,009,23656,720,0001,007,0002,113,536
6May 15, 2026 23:226,95768,431,96556,733,0001,014,0002,113,536
7May 15, 2026 23:227,08466,401,33057,798,0001,004,0002,113,536
8May 15, 2026 23:227,13366,467,86858,169,0001,040,0002,113,536
9May 15, 2026 23:227,13367,312,17259,208,00002,113,536