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 17, 2026 15:55shartgepettoshartgepettoScore: 7,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 15:557,17690,550,10256,531,0003,028,0002,473,984
2Mar 17, 2026 15:557,23583,430,64857,045,0003,002,0002,478,080
3Mar 17, 2026 15:557,24084,157,31058,092,0002,003,0002,387,968
4Mar 17, 2026 15:557,25183,982,17956,168,0004,012,0002,400,256
5Mar 17, 2026 15:557,27186,286,58257,335,0003,017,0002,383,872
6Mar 17, 2026 15:557,28083,197,29155,385,0005,035,0002,494,464
7Mar 17, 2026 15:557,28183,663,77056,405,0004,028,0002,318,336
8Mar 17, 2026 15:557,56793,207,21957,823,0004,984,0002,486,272
9Mar 17, 2026 15:557,59385,443,57359,021,0004,001,0002,392,064