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 7, 2026 19:28Kevin HeaveyKevin HeaveyScore: 4,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 19:284,25244,852,26034,282,0001,017,0002,117,632
2Jul 7, 2026 19:284,26344,982,73734,217,0001,169,0002,117,632
3Jul 7, 2026 19:284,27745,015,42834,341,0001,163,0002,117,632
4Jul 7, 2026 19:284,28345,272,45034,412,0001,144,0002,117,632
5Jul 7, 2026 19:284,29345,207,02834,487,0001,150,0002,117,632
6Jul 7, 2026 19:284,29645,251,85734,498,0001,161,0002,117,632
7Jul 7, 2026 19:284,30745,247,21534,584,0001,172,0002,117,632
8Jul 7, 2026 19:284,32445,389,84234,691,0001,199,0002,117,632
9Jul 7, 2026 19:284,33745,525,48034,815,0001,187,0002,117,632