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 11, 2026 18:13olliecrowolliecrowScore: 6,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:135,89377,653,29743,921,0004,991,0002,330,624
2Feb 11, 2026 18:135,97381,325,04846,541,0003,035,0002,490,368
3Feb 11, 2026 18:136,12278,629,20147,827,0002,989,0002,412,544
4Feb 11, 2026 18:136,25377,720,87748,905,0002,994,0002,265,088
5Feb 11, 2026 18:136,53585,130,78049,217,0005,022,0002,359,296
6Feb 11, 2026 18:136,58681,880,83852,637,0002,024,0002,322,432