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:12Wookyung JeongWookyung JeongScore: 58,895Success
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:1158,886513,616,989485,755,0002,998,0002,519,040
2Sep 25, 2025 10:1158,892517,288,063486,801,0001,999,0002,519,040
3Sep 25, 2025 10:1258,893516,958,638486,810,0001,999,0002,510,848
4Sep 25, 2025 10:1258,895524,133,356487,827,000999,0002,383,872
5Sep 25, 2025 10:1258,897516,746,328487,846,000999,0002,519,040
6Sep 25, 2025 10:1158,899518,654,200487,862,000999,0002,375,680