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 listJul 14, 2026 20:00boop34boop34Score: 14,069Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 20:0113,894125,059,934114,286,0001,040,0002,113,536
2Jul 14, 2026 20:0113,977125,855,873114,960,0001,053,0002,113,536
3Jul 14, 2026 20:0114,005126,461,532115,214,0001,030,0002,113,536
4Jul 14, 2026 20:0114,055126,879,287115,657,0001,007,0002,113,536
5Jul 14, 2026 20:0114,069127,148,629115,719,0001,058,0002,113,536
6Jul 14, 2026 20:0114,073127,038,920115,741,0001,072,0002,113,536
7Jul 14, 2026 20:0114,512130,724,893119,398,0001,055,0002,113,536
8Jul 14, 2026 20:0114,594131,388,073120,077,0001,057,0002,113,536
9Jul 14, 2026 20:0114,600131,227,087120,127,0001,060,0002,113,536