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 10:31Wookyung JeongWookyung JeongScore: 54,446Success
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 10:3154,427481,205,125449,750,0001,998,0002,392,064
2Sep 25, 2025 10:3254,436474,586,043449,817,0001,999,0002,289,664
3Sep 25, 2025 10:3254,440478,523,717449,857,0001,999,0002,514,944
4Sep 25, 2025 10:3154,446476,529,573449,900,0001,999,0002,289,664
5Sep 25, 2025 10:3154,452478,146,644450,949,000999,0002,289,664
6Sep 25, 2025 10:3254,452479,112,399449,955,0001,999,0002,281,472