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 3, 2026 04:10Josu San MartinJosu San MartinScore: 9,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 04:109,281101,181,14073,034,0004,001,0002,441,216
2Jan 3, 2026 04:109,306100,276,99174,229,0003,009,0002,281,472
3Jan 3, 2026 04:109,395101,649,34172,984,0004,998,0002,281,472
4Jan 3, 2026 04:109,497101,038,65773,838,0004,989,0002,441,216
5Jan 3, 2026 04:109,500100,074,80473,864,0004,990,0002,277,376
6Jan 3, 2026 04:109,580100,624,82677,503,0002,013,0002,441,216