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 listJan 11, 2026 13:54Pavel SkripkinPavel SkripkinScore: 35,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 13:5435,528323,118,082292,881,0001,999,0002,441,216
2Jan 11, 2026 13:5435,535319,185,632292,941,0001,999,0002,543,616
3Jan 11, 2026 13:5435,548316,820,220293,049,0002,000,0002,433,024
4Jan 11, 2026 13:5435,549317,959,996294,055,0001,000,0002,445,312
5Jan 11, 2026 13:5435,551316,543,674294,070,0001,000,0002,543,616
6Jan 11, 2026 13:5435,554319,216,459293,097,0002,000,0002,437,120
7Jan 11, 2026 13:5435,572314,463,426294,245,0001,000,0002,437,120
8Jan 11, 2026 13:5435,573315,399,632295,256,00002,543,616
9Jan 11, 2026 13:5435,590317,326,326294,394,0001,001,0002,543,616