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:15Wookyung JeongWookyung JeongScore: 54,743Success
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:1554,730475,525,336453,257,0001,000,0002,383,872
2Sep 25, 2025 10:1554,743479,618,440452,369,0002,001,0002,519,040
3Sep 25, 2025 10:1554,744478,694,146452,377,0002,001,0002,379,776