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:53caandocaandoScore: 5,042Success
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:535,02365,888,20040,676,0001,016,0002,523,136
2Mar 10, 2026 16:535,04067,807,97539,839,0001,991,0002,285,568
3Mar 10, 2026 16:535,04167,776,62639,849,0001,992,0002,285,568
4Mar 10, 2026 16:535,04272,923,37138,857,0002,989,0002,285,568
5Mar 10, 2026 16:535,05764,159,28339,973,0001,998,0002,506,752
6Mar 10, 2026 16:535,11168,094,02740,402,0002,020,0002,523,136