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 listJan 30, 2026 03:29Josu San MartinJosu San MartinScore: 6,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 03:295,88072,965,01646,815,0001,992,0002,527,232
2Jan 30, 2026 03:296,05480,733,64348,236,0002,009,0002,281,472
3Jan 30, 2026 03:296,11575,374,46749,763,000995,0002,281,472
4Jan 30, 2026 03:296,25876,998,54449,947,0001,997,0002,441,216
5Jan 30, 2026 03:296,26677,793,93850,007,0002,000,0002,285,568
6Jan 30, 2026 03:296,37674,680,15450,925,0001,997,0002,285,568