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 20, 2026 10:33Victor MerckléVictor MerckléScore: 5,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:345,72655,327,03646,514,0001,017,0002,113,536
2May 20, 2026 10:345,78855,864,19947,025,0001,022,0002,113,536
3May 20, 2026 10:345,90956,832,94848,028,0001,024,0002,113,536
4May 20, 2026 10:345,91157,300,38347,994,0001,074,0002,113,536
5May 20, 2026 10:345,91457,192,51748,064,0001,025,0002,113,536
6May 20, 2026 10:345,92857,161,51148,200,0001,005,0002,113,536
7May 20, 2026 10:345,94158,294,41948,302,0001,013,0002,113,536
8May 20, 2026 10:345,94958,102,90048,345,0001,039,0002,113,536
9May 20, 2026 10:345,95957,536,13448,462,0001,000,0002,113,536