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 25, 2026 20:54Maya RebholzMaya RebholzScore: 5,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 20:545,82759,595,83443,237,0005,128,0002,117,632
2May 25, 2026 20:545,85159,698,34843,052,0005,518,0002,113,536
3May 25, 2026 20:545,89460,460,63443,516,0005,410,0002,113,536
4May 25, 2026 20:545,90961,227,31043,518,0005,532,0002,113,536
5May 25, 2026 20:545,94461,070,02143,801,0005,535,0002,113,536
6May 25, 2026 20:545,95661,229,90243,814,0005,623,0002,113,536
7May 25, 2026 20:545,97260,269,31044,094,0005,480,0002,117,632
8May 25, 2026 20:546,02762,281,14244,367,0005,661,0002,117,632
9May 25, 2026 20:546,22763,513,39246,006,0005,685,0002,113,536