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 listApr 12, 2026 22:21Josu San MartinJosu San MartinScore: 5,069Success
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 19:004,96663,390,99939,204,0002,010,0002,281,472
2Apr 12, 2026 22:214,99964,131,71940,482,0001,012,0002,285,568
3Mar 10, 2026 19:005,01064,621,01639,602,0001,980,0002,281,472
4Apr 12, 2026 02:505,04467,062,66740,866,000996,0002,367,488
5Apr 12, 2026 02:505,05665,257,60639,963,0001,998,0002,383,872
6Mar 10, 2026 19:005,06161,056,88840,004,0002,000,0002,281,472
7Mar 10, 2026 19:005,06964,915,44740,068,0002,003,0002,281,472
8Apr 12, 2026 22:215,26368,028,51442,666,0001,015,0002,285,568
9Apr 12, 2026 02:505,28072,776,46741,835,0001,992,0002,285,568
10Mar 10, 2026 19:005,28372,702,52142,827,0001,019,0002,379,776
11Apr 12, 2026 22:215,30566,049,06442,030,0002,001,0002,375,680
12Mar 10, 2026 19:005,32764,568,70543,206,0001,004,0002,281,472