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 18, 2026 00:53avoidcatenjoyersavoidcatenjoyersScore: 91,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 00:5391,611769,855,446701,237,00059,135,0002,113,536
2May 18, 2026 00:5391,644772,223,293701,266,00059,381,0002,113,536
3May 18, 2026 00:5391,689771,077,980701,379,00059,640,0002,113,536
4May 18, 2026 00:5391,694772,803,804702,887,00058,181,0002,113,536
5May 18, 2026 00:5391,718773,577,916701,512,00059,751,0002,113,536
6May 18, 2026 00:5391,727771,704,622702,629,00058,707,0002,113,536
7May 18, 2026 00:5391,738772,999,077701,564,00059,864,0002,113,536
8May 18, 2026 00:5391,797771,830,129702,956,00058,963,0002,113,536
9May 18, 2026 00:5391,876773,964,331701,893,00060,681,0002,113,536