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 listOct 22, 2025 12:26Jeongbong SeoJeongbong SeoScore: 68,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2025 12:2668,345593,491,383566,267,0001,000,0002,387,968
2Oct 22, 2025 12:2668,359591,535,889567,378,00002,260,992
3Oct 22, 2025 12:2668,381596,213,543565,562,0001,998,0002,383,872
4Oct 22, 2025 12:2668,417593,011,552566,866,000999,0002,265,088
5Oct 22, 2025 12:2668,424597,549,030565,923,0001,999,0002,260,992
6Oct 22, 2025 12:2668,474595,073,695567,338,0001,000,0002,379,776
7Oct 22, 2025 12:2668,517599,658,889567,692,000999,0002,519,040
8Oct 22, 2025 12:2668,527592,606,238566,773,0001,999,0002,256,896
9Oct 22, 2025 12:2668,799591,200,749570,031,0001,000,0002,260,992