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 listFeb 15, 2026 18:35Daniel MastalerzDaniel MastalerzScore: 6,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 18:356,26979,577,70649,033,0003,002,0002,514,944
2Feb 15, 2026 18:356,30076,257,90548,267,0004,022,0002,293,760
3Feb 15, 2026 18:356,30973,432,64548,334,0004,027,0002,326,528
4Feb 15, 2026 18:356,38275,421,21548,974,0003,997,0002,318,336
5Feb 15, 2026 18:356,38781,715,05649,014,0004,001,0002,265,088
6Feb 15, 2026 18:356,39580,515,96450,077,0003,004,0002,273,280