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 14:48Victor MerckléVictor MerckléScore: 7,885Success
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 14:497,87675,233,86065,373,00002,113,536
2May 13, 2026 14:497,88274,751,62365,426,00002,113,536
3May 13, 2026 14:497,88275,805,81465,426,00002,113,536
4May 13, 2026 14:497,88572,764,93964,430,0001,017,0002,113,536
5May 13, 2026 14:497,88572,737,92865,448,00002,113,536
6May 13, 2026 14:497,88674,864,49964,459,0001,002,0002,113,536
7May 13, 2026 14:497,88875,056,74964,438,0001,039,0002,113,536
8May 13, 2026 14:497,89074,572,43664,481,0001,008,0002,113,536
9May 13, 2026 14:498,14777,026,78466,588,0001,038,0002,113,536