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 13, 2026 16:37caandocaandoScore: 6,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 16:365,66070,104,65144,979,0001,999,0002,486,272
2Mar 13, 2026 16:365,74275,186,50246,644,0001,014,0002,478,080
3Mar 13, 2026 16:365,78977,399,85546,050,0002,002,0002,478,080
4Mar 13, 2026 16:346,02380,828,62347,992,0001,999,0002,285,568
5Mar 13, 2026 16:376,03672,401,58848,094,0002,003,0002,285,568
6Mar 13, 2026 16:376,05273,618,22147,219,0003,013,0002,285,568
7Mar 13, 2026 16:376,07371,552,55849,401,0001,008,0002,285,568
8Mar 13, 2026 16:346,07776,933,55648,424,0002,017,0002,285,568
9Mar 13, 2026 16:376,08473,281,17749,491,0001,010,0002,285,568
10Mar 13, 2026 16:346,08577,947,41148,484,0002,020,0002,285,568
11Mar 13, 2026 16:376,10581,390,52649,655,0001,013,0002,469,888
12Mar 13, 2026 16:376,12281,169,00048,819,0001,992,0002,486,272