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 17, 2025 19:17sheryllynn24sheryllynn24Score: 30,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2025 19:1730,853283,013,253254,084,0002,000,0002,273,280
2Sep 17, 2025 19:1730,856284,875,866254,104,0002,000,0002,510,848
3Sep 17, 2025 19:1730,858282,514,016251,119,0005,002,0002,277,376
4Sep 17, 2025 19:1730,863280,586,762255,166,0001,000,0002,260,992
5Sep 17, 2025 19:1730,879282,795,266255,297,0001,001,0002,273,280
6Sep 17, 2025 19:1730,898293,799,985253,452,0003,005,0002,273,280
7Sep 17, 2025 19:1730,930292,733,443252,722,0003,995,0002,277,376
8Sep 17, 2025 19:1730,981287,233,337256,145,0001,000,0002,277,376
9Sep 17, 2025 19:1731,117285,521,015256,268,0002,002,0002,359,296