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 15, 2026 13:08wnwnScore: 3,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 13:083,29035,552,99027,312,00002,113,536
2May 15, 2026 13:083,29636,106,99127,360,00002,113,536
3May 15, 2026 13:083,29834,849,21527,377,00002,113,536
4May 15, 2026 13:083,30036,906,29427,398,00002,113,536
5May 15, 2026 13:083,30536,688,86527,433,00002,113,536
6May 15, 2026 13:083,31436,621,06627,508,00002,113,536
7May 15, 2026 13:083,32135,612,63227,567,00002,113,536
8May 15, 2026 13:083,33337,091,92227,664,00002,113,536
9May 15, 2026 13:083,44738,027,54928,613,00002,113,536