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 24, 2026 05:58wnwnScore: 4,048Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 05:593,81740,411,66326,687,0005,001,00020,480
2Sep 24, 2026 05:593,86740,892,73327,151,0004,952,00020,480
3Sep 24, 2026 05:593,92441,419,58626,941,0005,633,00020,480
4Sep 24, 2026 05:594,03342,280,71228,029,0005,452,00020,480
5Sep 24, 2026 05:594,04843,794,19327,005,0006,601,00020,480
6Sep 24, 2026 05:594,08442,699,61727,021,0006,883,0002,113,536
7Sep 24, 2026 05:594,09842,762,56828,476,0005,541,00020,480
8Sep 24, 2026 05:594,09942,801,80127,063,0006,963,0002,113,536
9Sep 24, 2026 05:594,10942,757,58727,133,0006,977,0002,113,536