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 18, 2026 10:23shartgepettoshartgepettoScore: 6,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 10:236,15776,271,19948,094,0003,005,0002,392,064
2Mar 18, 2026 10:236,18573,344,10549,322,0002,013,0002,478,080
3Mar 18, 2026 10:236,21977,676,07449,592,0002,024,0002,486,272
4Mar 18, 2026 10:236,26278,959,05748,978,0002,998,0002,441,216
5Mar 18, 2026 10:236,27075,177,03049,039,0003,002,0002,387,968
6Mar 18, 2026 10:236,28876,621,38650,186,0002,007,0002,351,104
7Mar 18, 2026 10:236,30976,554,97151,358,0001,007,0002,375,680
8Mar 18, 2026 10:236,33173,653,30150,529,0002,021,0002,490,368
9Mar 18, 2026 10:236,34582,421,75949,626,0003,038,0002,461,696