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:55Josu San MartinJosu San MartinScore: 4,241Success
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:564,23443,992,00134,106,0001,041,0002,113,536
2Aug 30, 2026 21:564,23743,613,45334,122,0001,050,0002,113,536
3Aug 30, 2026 21:564,23843,703,17034,145,0001,038,0002,113,536
4Aug 30, 2026 21:564,23843,627,14234,156,0001,027,0002,113,536
5Aug 30, 2026 21:564,24143,733,99834,173,0001,029,0002,113,536
6Aug 30, 2026 21:564,25043,806,95434,248,0001,035,0002,113,536
7Aug 30, 2026 21:564,26144,005,26434,251,0001,121,0002,113,536
8Aug 30, 2026 21:564,27243,957,61534,337,0001,122,0002,113,536
9Aug 30, 2026 21:564,28844,028,17834,528,0001,067,0002,113,536