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:14caandocaandoScore: 4,996Success
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:144,95065,159,73139,080,0002,004,0002,285,568
2Mar 10, 2026 16:144,95463,558,32340,119,0001,002,0002,379,776
3Mar 10, 2026 16:144,97367,565,74139,261,0002,013,0002,285,568
4Mar 10, 2026 16:144,99162,808,22741,426,00002,285,568
5Mar 10, 2026 16:144,99463,956,53538,416,0003,032,0002,285,568
6Mar 10, 2026 16:144,99564,621,70340,447,0001,011,0002,285,568
7Mar 10, 2026 16:144,99663,745,89741,466,00002,285,568
8Mar 10, 2026 16:144,99665,732,47740,456,0001,011,0002,285,568
9Mar 10, 2026 16:145,03769,563,02640,812,000995,0002,285,568
10Mar 10, 2026 16:145,04171,376,14039,850,0001,992,0002,514,944
11Mar 10, 2026 16:145,04861,304,77140,876,0001,021,0002,285,568
12Mar 10, 2026 16:145,06569,210,81140,041,0002,002,0002,285,568