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:24Wookyung JeongWookyung JeongScore: 54,695Success
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:2454,689483,575,500451,922,0001,999,0002,379,776
2Sep 25, 2025 10:2454,695480,205,806452,973,000999,0002,260,992
3Sep 25, 2025 10:2454,714482,423,821454,127,00002,519,040