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 6, 2026 13:54Teow Hua JunTeow Hua JunScore: 12,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 13:5612,023109,328,22698,591,0001,203,0002,113,536
2Jul 6, 2026 13:5612,026109,251,85698,593,0001,223,0002,113,536
3Jul 6, 2026 13:5612,030109,795,17898,626,0001,229,0002,113,536
4Jul 6, 2026 13:5612,030109,217,53598,706,0001,146,0002,113,536
5Jul 6, 2026 13:5612,030109,251,49098,644,0001,205,0002,113,536
6Jul 6, 2026 13:5612,034110,102,66298,715,0001,171,0002,113,536
7Jul 6, 2026 13:5612,036109,307,75098,653,0001,254,0002,113,536
8Jul 6, 2026 13:5612,055109,590,35798,794,0001,266,0002,113,536
9Jul 6, 2026 13:5612,338111,805,997101,178,0001,231,0002,113,536