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 listNov 9, 2025 11:34izotoffizotoffScore: 48,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2025 11:3448,972430,175,553406,469,00002,539,520
2Nov 20, 2025 20:4148,973431,737,931405,474,0001,001,0002,531,328
3Nov 20, 2025 20:4148,975432,321,880406,495,00002,510,848
4Nov 9, 2025 11:3448,977435,920,239406,509,00002,375,680
5Nov 9, 2025 11:3448,994432,231,097404,649,0001,998,0002,543,616
6Nov 9, 2025 11:3448,995436,950,157403,661,0002,997,0002,514,944
7Nov 9, 2025 11:3448,997437,152,242403,674,0002,997,0002,510,848
8Nov 9, 2025 11:3448,999437,291,114405,690,000999,0002,342,912
9Nov 9, 2025 11:3449,000431,274,397405,700,000999,0002,543,616
10Nov 9, 2025 11:3449,011431,106,357404,793,0001,998,0002,543,616
11Nov 20, 2025 20:4149,020434,197,610404,865,0001,999,0002,531,328
12Nov 9, 2025 11:3449,027437,590,891405,921,000999,0002,539,520