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 listMar 12, 2026 23:41zielajzielajScore: 3,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 23:413,51648,385,34528,178,0001,006,0002,338,816
2Mar 12, 2026 23:413,53254,549,70627,292,0002,021,0002,334,720
3Mar 12, 2026 23:413,54053,623,35429,378,00002,342,912
4Mar 12, 2026 23:413,56453,959,18429,585,00002,519,040
5Mar 12, 2026 23:413,57050,820,38828,608,0001,021,0002,338,816
6Mar 12, 2026 23:413,71955,469,49530,864,00002,510,848
7Mar 12, 2026 23:413,75856,577,70830,182,0001,006,0002,531,328
8Mar 12, 2026 23:413,77557,573,45730,324,0001,010,0002,531,328
9Mar 12, 2026 23:413,77652,593,64230,327,0001,010,0002,527,232
10Mar 12, 2026 23:413,77650,799,62631,337,00002,342,912
11Mar 12, 2026 23:413,79154,102,33430,452,0001,015,0002,531,328
12Mar 12, 2026 23:413,80360,062,78830,547,0001,018,0002,351,104