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 16:20caandocaandoScore: 5,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 16:204,96868,736,86740,228,0001,005,0002,285,568
2Mar 10, 2026 16:204,98365,494,48438,333,0003,026,0002,285,568
3Mar 10, 2026 16:204,98767,773,81240,381,0001,009,0002,285,568
4Mar 10, 2026 16:204,99267,929,70340,423,0001,010,0002,506,752
5Mar 10, 2026 16:204,99466,898,80540,437,0001,010,0002,269,184
6Mar 10, 2026 16:204,99668,393,07841,466,00002,285,568
7Mar 10, 2026 16:205,00871,121,85640,550,0001,013,0002,285,568
8Mar 10, 2026 16:205,01068,794,66040,569,0001,014,0002,523,136
9Mar 10, 2026 16:205,01567,741,68540,612,0001,015,0002,285,568
10Mar 10, 2026 16:205,03771,010,52639,820,0001,991,0002,285,568
11Mar 10, 2026 16:205,04069,446,08639,838,0001,991,0002,285,568
12Mar 10, 2026 16:205,04068,381,60040,840,000996,0002,523,136