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 22, 2026 18:57Kasper KivimäkiKasper KivimäkiScore: 61,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 18:5760,838514,801,020503,901,0001,055,0002,113,536
2Jul 22, 2026 18:5760,926515,620,598504,625,0001,066,0002,113,536
3Jul 22, 2026 18:5760,984516,665,134505,109,0001,065,0002,113,536
4Jul 22, 2026 18:5761,247518,891,623507,350,0001,002,0002,113,536
5Jul 22, 2026 18:5761,614522,026,107510,395,0001,002,0002,113,536
6Jul 22, 2026 18:5761,786523,395,560511,826,0001,003,0002,113,536
7Jul 22, 2026 18:5761,921524,252,769512,879,0001,071,0002,113,536
8Jul 22, 2026 18:5762,060525,638,662514,094,0001,006,0002,113,536
9Jul 22, 2026 18:5762,094525,985,253514,303,0001,081,0002,113,536