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 25, 2025 08:19Wookyung JeongWookyung JeongScore: 119,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 08:19119,1531,016,506,544986,970,0001,999,0002,514,944
2Sep 25, 2025 08:19119,1551,017,086,785987,987,000999,0002,375,680
3Sep 25, 2025 08:19119,2611,017,766,631986,869,0002,999,0002,256,896