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:28Josu San MartinJosu San MartinScore: 6,195Success
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:285,83372,138,71347,402,0001,008,0002,527,232
2Jan 30, 2026 03:286,08171,068,02448,453,0002,018,0002,441,216
3Jan 30, 2026 03:286,09075,687,99349,534,0001,010,0002,285,568
4Jan 30, 2026 03:286,19571,882,59350,409,0001,008,0002,445,312
5Jan 30, 2026 03:286,21073,950,02850,530,0001,010,0002,285,568
6Jan 30, 2026 03:286,36779,660,75850,850,0001,994,0002,285,568