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 00:22olliecrowolliecrowScore: 8,175Success
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 00:227,96192,100,90361,071,0005,005,0002,387,968
2Feb 18, 2026 00:228,069100,423,82563,976,0002,998,0002,494,464
3Feb 18, 2026 00:228,14597,019,80565,587,0002,018,0002,342,912
4Feb 18, 2026 00:228,17592,477,19764,856,0002,993,0002,465,792
5Feb 18, 2026 00:228,44399,508,12566,069,0004,004,0002,482,176
6Feb 18, 2026 00:228,465100,071,45369,260,0001,003,0002,330,624