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 listFeb 18, 2026 15:27wnwnScore: 7,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 15:277,37081,998,31159,166,0002,005,0002,539,520
2Feb 18, 2026 15:277,37482,610,58059,199,0002,006,0002,281,472
3Feb 18, 2026 15:277,38188,468,98859,256,0002,008,0002,441,216
4Feb 18, 2026 15:277,38879,413,91759,309,0002,010,0002,437,120
5Feb 18, 2026 15:277,39486,268,88260,362,0001,006,0002,433,024
6Feb 18, 2026 15:277,41187,200,16560,507,0001,008,0002,277,376