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 10, 2026 04:20olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 27, 2026 12:01wn147.86RecheckSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 12:01025,913,8069,020,0000294,912Exit with code 1:
2Mar 10, 2026 04:202,97948,315,11223,692,0001,030,0002,289,664
3Mar 10, 2026 04:202,98749,056,29723,759,0001,033,0002,289,664
4Mar 10, 2026 04:203,00053,121,03423,907,000996,0002,277,376
5Mar 10, 2026 04:203,00150,956,51922,914,0001,992,0002,285,568
6Mar 10, 2026 04:203,00254,108,27322,920,0001,993,0002,289,664
7Mar 10, 2026 04:203,00252,308,39622,922,0001,993,0002,281,472
8Mar 10, 2026 04:203,00347,780,72123,929,000997,0002,289,664
9Mar 10, 2026 04:203,01149,405,46123,990,000999,0002,289,664
10Mar 10, 2026 04:203,01249,993,14122,998,0001,999,0002,289,664