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 3, 2026 23:52Josu San MartinJosu San MartinScore: 7,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 23:537,07568,252,01750,093,0008,631,0002,113,536
2Jul 3, 2026 23:537,07567,988,44650,067,0008,661,0002,113,536
3Jul 3, 2026 23:537,08468,120,19650,199,0008,600,0002,113,536
4Jul 3, 2026 23:537,08968,119,20749,940,0008,904,0002,113,536
5Jul 3, 2026 23:537,10368,202,75350,494,0008,469,0002,113,536
6Jul 3, 2026 23:537,10668,576,82150,403,0008,579,0002,113,536
7Jul 3, 2026 23:537,18368,968,44651,003,0008,620,0002,113,536
8Jul 3, 2026 23:537,19169,127,99251,038,0008,648,0002,113,536
9Jul 3, 2026 23:537,31269,967,34251,131,0009,565,0002,113,536