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 17, 2026 10:04Joel ChongJoel ChongScore: 49,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 10:0449,634435,222,635409,964,0001,999,0002,519,040
2Mar 17, 2026 10:0449,670443,080,579411,257,0001,000,0002,514,944
3Mar 17, 2026 10:0449,728434,254,192410,741,0001,998,0002,289,664
4Mar 17, 2026 10:0449,754439,896,870410,956,0001,999,0002,285,568
5Mar 17, 2026 10:0449,868438,086,961411,903,0001,999,0002,375,680
6Mar 17, 2026 10:0449,873435,959,705411,949,0001,999,0002,367,488
7Mar 17, 2026 10:0449,889437,062,703413,075,0001,000,0002,277,376
8Mar 17, 2026 10:0449,900435,833,731413,171,0001,000,0002,523,136
9Mar 17, 2026 10:0449,971441,905,406412,759,0001,998,0002,285,568