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 19, 2026 13:51Victor MerckléVictor MerckléScore: 5,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 13:525,88157,036,39947,801,0001,012,0002,113,536
2May 19, 2026 13:525,88856,547,73047,868,0001,008,0002,113,536
3May 19, 2026 13:525,89057,671,25747,865,0001,029,0002,113,536
4May 19, 2026 13:525,89156,655,95447,860,0001,036,0002,113,536
5May 19, 2026 13:525,89358,840,29747,905,0001,014,0002,113,536
6May 19, 2026 13:525,89558,837,52347,916,0001,018,0002,113,536
7May 19, 2026 13:525,93858,708,94348,265,0001,021,0002,113,536
8May 19, 2026 13:526,05660,828,30049,236,0001,034,0002,113,536
9May 19, 2026 13:526,06659,964,23949,329,0001,021,0002,113,536