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 listAug 30, 2026 21:29Josu San MartinJosu San MartinScore: 4,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:304,25943,829,34434,321,0001,032,0002,113,536
2Aug 30, 2026 21:304,26443,843,88734,370,0001,029,0002,113,536
3Aug 30, 2026 21:304,26444,171,17834,320,0001,079,0002,113,536
4Aug 30, 2026 21:304,27445,259,91534,451,0001,025,0002,113,536
5Aug 30, 2026 21:304,28443,998,31034,434,0001,124,0002,113,536
6Aug 30, 2026 21:304,28944,080,39434,488,0001,117,0002,113,536
7Aug 30, 2026 21:304,29044,100,52034,564,0001,043,0002,113,536
8Aug 30, 2026 21:304,31244,265,06234,672,0001,124,0002,113,536
9Aug 30, 2026 21:304,32944,771,63934,805,0001,127,0002,113,536