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 11:22Victor MerckléVictor MerckléScore: 6,116Success
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 11:236,05058,016,54049,206,0001,016,0002,113,536
2May 19, 2026 11:236,05361,298,51749,218,0001,026,0002,113,536
3May 19, 2026 11:236,05561,068,28549,231,0001,033,0002,113,536
4May 19, 2026 11:236,06659,487,47149,229,0001,125,0002,113,536
5May 19, 2026 11:236,11661,489,66549,759,0001,005,0002,113,536
6May 19, 2026 11:236,16559,918,94750,140,0001,037,0002,113,536
7May 19, 2026 11:236,18059,811,67450,264,0001,030,0002,113,536
8May 19, 2026 11:236,24162,053,26050,762,0001,039,0002,113,536
9May 19, 2026 11:236,28659,989,66951,174,0001,008,0002,113,536