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 listApr 22, 2026 02:19Taylor DettlingTaylor DettlingScore: 7,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 02:217,34375,976,74657,952,0002,997,0002,375,680
2Apr 22, 2026 02:217,34379,557,98357,955,0002,997,0002,359,296
3Apr 22, 2026 02:217,34378,761,00957,951,0002,997,0002,351,104
4Apr 22, 2026 02:217,35377,454,28456,034,0005,003,0002,363,392
5Apr 22, 2026 02:217,35479,801,77758,044,0003,002,0002,371,584
6Apr 22, 2026 02:217,35680,301,49958,058,0003,003,0002,375,680
7Apr 22, 2026 02:217,37177,260,40459,176,0002,005,0002,371,584
8Apr 22, 2026 02:217,37775,744,37259,227,0002,007,0002,445,312
9Apr 22, 2026 02:217,45682,532,36358,896,0002,994,0002,375,680