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 21, 2026 11:35Victor MerckléVictor MerckléScore: 4,839Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 11:364,79049,248,72938,639,0001,122,0002,113,536
2May 21, 2026 11:364,80647,753,38538,754,0001,136,0002,113,536
3May 21, 2026 11:364,82350,037,32238,957,0001,080,0002,113,536
4May 21, 2026 11:364,82747,948,78539,030,0001,042,0002,113,536
5May 21, 2026 11:364,83948,723,68139,127,0001,037,0002,113,536
6May 21, 2026 11:364,84948,105,56039,207,0001,041,0002,113,536
7May 21, 2026 11:364,86748,219,28339,359,0001,041,0002,113,536
8May 21, 2026 11:364,91150,353,43139,688,0001,078,0002,113,536
9May 21, 2026 11:365,04550,372,64840,879,0001,002,0002,113,536