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 listApr 13, 2026 01:33Josu San MartinJosu San MartinScore: 5,015Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 19:204,98061,840,93540,323,0001,008,0002,285,568
2Apr 13, 2026 01:335,00364,235,42640,513,0001,012,0002,392,064
3Apr 12, 2026 19:205,00669,527,12940,533,0001,013,0002,285,568
4Apr 13, 2026 01:335,01566,041,03740,606,0001,015,0002,387,968
5Apr 12, 2026 19:205,02368,325,45140,672,0001,016,0002,396,160
6Apr 13, 2026 01:335,22062,485,17242,319,0001,007,0002,400,256