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 15, 2026 16:15shartgepettoshartgepettoScore: 10,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 16:1510,131111,619,96381,088,0003,003,0002,383,872
2Mar 15, 2026 16:1510,163107,816,64379,332,0005,021,0002,318,336
3Mar 15, 2026 16:1510,174108,286,72979,418,0005,026,0002,301,952
4Mar 15, 2026 16:1510,254110,451,44280,101,0005,006,0002,494,464
5Mar 15, 2026 16:1510,283113,774,19681,335,0004,016,0002,482,176
6Mar 15, 2026 16:1510,302111,761,54083,497,0002,011,0002,322,432
7Mar 15, 2026 16:1510,319116,518,57182,626,0003,022,0002,367,488
8Mar 15, 2026 16:1510,364111,209,19082,019,0004,000,0002,478,080
9Mar 15, 2026 16:1510,399105,554,84082,300,0004,014,0002,273,280