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 13, 2026 00:35Victor MerckléVictor MerckléScore: 9,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 00:369,35686,436,22776,547,0001,114,0002,113,536
2May 13, 2026 00:369,35789,307,59276,553,0001,115,0002,113,536
3May 13, 2026 00:369,36688,338,17376,558,0001,182,0002,113,536
4May 13, 2026 00:369,36788,398,06276,558,0001,189,0002,113,536
5May 13, 2026 00:369,36786,512,37676,561,0001,190,0002,113,536
6May 13, 2026 00:369,36887,951,29376,756,0001,003,0002,113,536
7May 13, 2026 00:369,36988,699,30876,762,0001,006,0002,113,536
8May 13, 2026 00:369,37187,355,63576,772,0001,008,0002,113,536
9May 13, 2026 00:369,40989,051,04576,907,0001,191,0002,113,536