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 13:33wnwnScore: 7,207Success
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 13:336,24381,252,87548,825,0002,989,0002,293,760
2Feb 18, 2026 13:336,28380,768,83648,140,0004,011,0002,379,776
3Feb 18, 2026 13:336,28674,025,92947,157,0005,016,0002,482,176
4Feb 18, 2026 13:337,20793,733,74655,829,0003,987,0002,338,816
5Feb 18, 2026 13:337,25085,615,15856,161,0004,011,0002,523,136
6Feb 18, 2026 13:337,26486,086,57057,276,0003,014,0002,441,216