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 31, 2026 21:39olliecrowolliecrowScore: 6,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 21:396,03774,090,04547,099,0003,006,0002,379,776
2Jan 31, 2026 21:396,07479,097,77344,365,0006,049,0002,310,144
3Jan 31, 2026 21:396,10077,624,59147,592,0003,037,0002,396,160
4Jan 31, 2026 21:396,37980,039,29247,949,0004,994,0002,498,560
5Jan 31, 2026 21:396,39077,256,82151,034,0002,001,0002,506,752
6Jan 31, 2026 21:396,44979,025,06450,500,0003,030,0002,461,696