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 29, 2026 16:46Josu San MartinJosu San MartinScore: 4,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 16:464,52845,976,74636,466,0001,120,0002,113,536
2Aug 29, 2026 16:464,53146,021,11636,499,0001,109,0002,113,536
3Aug 29, 2026 16:464,53546,092,02036,530,0001,118,0002,113,536
4Aug 29, 2026 16:464,54146,148,31936,565,0001,126,0002,113,536
5Aug 29, 2026 16:464,55746,275,30136,789,0001,038,0002,113,536
6Aug 29, 2026 16:464,55846,286,73636,697,0001,136,0002,113,536
7Aug 29, 2026 16:464,56346,250,80436,762,0001,113,0002,113,536
8Aug 29, 2026 16:464,56446,309,94036,749,0001,135,0002,113,536
9Aug 29, 2026 16:464,57746,375,98036,880,0001,115,0002,113,536