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 listMar 17, 2026 03:01zielajzielajScore: 3,513Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 03:013,47756,444,74726,867,0001,990,0002,449,408
2Mar 17, 2026 02:573,49252,073,70126,984,0001,998,0002,441,216
3Mar 17, 2026 02:573,51154,202,18327,133,0002,009,0002,260,992
4Mar 17, 2026 03:013,51350,417,61227,150,0002,011,0002,523,136
5Mar 17, 2026 03:013,52053,553,67127,201,0002,014,0002,437,120
6Mar 17, 2026 02:573,52153,079,02527,207,0002,015,0002,445,312