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 4, 2026 23:44olliecrowolliecrowScore: 6,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:455,96456,022,12347,291,0002,217,0002,363,392
2May 4, 2026 23:455,99056,168,00747,554,0002,166,0002,555,904
3May 4, 2026 23:456,00756,318,85347,637,0002,226,0002,531,328
4May 4, 2026 23:456,04156,563,06547,899,0002,248,0002,551,808
5May 4, 2026 23:456,10356,845,46048,479,0002,181,0002,330,624
6May 4, 2026 23:456,10657,460,32648,513,0002,173,0002,334,720
7May 4, 2026 23:456,11657,895,64148,506,0002,264,0002,523,136
8May 4, 2026 23:456,12957,508,06548,653,0002,219,0002,387,968
9May 4, 2026 23:456,13856,802,43448,708,0002,238,0002,498,560