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 listSep 18, 2025 02:14Elnur RakhmatullinElnur RakhmatullinScore: 40,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2025 02:1440,055358,879,596330,457,0001,996,0002,265,088
2Sep 18, 2025 02:1440,056359,099,184332,464,00002,408,448
3Sep 18, 2025 02:1440,062355,189,265331,514,0001,001,0002,519,040
4Sep 18, 2025 02:1440,069355,032,309331,577,000998,0002,519,040
5Sep 18, 2025 02:1440,151359,693,829331,249,0002,001,0002,269,184
6Sep 18, 2025 02:1440,182361,198,886330,513,0002,995,0002,400,256
7Sep 18, 2025 02:1440,192362,195,213331,599,0001,997,0002,269,184
8Sep 18, 2025 02:1440,197362,194,449331,639,0001,997,0002,400,256
9Sep 18, 2025 02:1440,197363,506,886331,639,0001,997,0002,383,872