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 21, 2026 13:04olliecrowolliecrowScore: 11,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 13:0911,111116,690,32583,202,0009,021,0002,400,256
2Mar 21, 2026 13:0611,146122,263,99181,453,00011,061,0002,383,872
3Mar 21, 2026 13:0411,178119,381,73781,803,00010,973,0002,510,848
4Mar 21, 2026 13:0611,185119,247,45182,851,0009,982,0002,400,256
5Mar 21, 2026 13:0911,189119,170,19685,882,0006,990,0002,494,464
6Mar 21, 2026 13:0411,201115,421,85183,969,0008,996,0002,301,952
7Mar 21, 2026 13:0411,310115,611,97586,879,0006,990,0002,326,528
8Mar 21, 2026 13:0911,342120,031,25385,123,0009,013,0002,514,944
9Mar 21, 2026 13:0611,919123,306,68991,932,0006,994,0002,441,216