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 10, 2026 13:40wnwnScore: 3,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:403,24436,761,44226,927,00002,113,536
2May 10, 2026 13:403,24435,850,44026,932,00002,113,536
3May 10, 2026 13:403,25236,469,91726,995,00002,113,536
4May 10, 2026 13:403,25537,437,01727,019,00002,113,536
5May 10, 2026 13:403,26237,223,87327,081,00002,113,536
6May 10, 2026 13:403,39937,349,12828,215,00002,113,536
7May 10, 2026 13:403,40138,796,59728,236,00002,113,536
8May 10, 2026 13:403,42539,315,77628,432,00002,113,536
9May 10, 2026 13:403,44638,392,16228,610,00002,113,536