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 listJul 16, 2026 08:00wnwnScore: 3,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 08:003,70738,792,20929,736,0001,033,0002,113,536
2Jul 16, 2026 08:003,71038,724,09129,762,0001,037,0002,113,536
3Jul 16, 2026 08:003,71338,921,53029,793,0001,033,0002,113,536
4Jul 16, 2026 08:003,71938,818,21029,861,0001,010,0002,113,536
5Jul 16, 2026 08:003,72138,828,29029,858,0001,032,0002,113,536
6Jul 16, 2026 08:003,72739,055,28629,857,0001,085,0002,113,536
7Jul 16, 2026 08:003,73239,109,92429,981,0001,002,0002,113,536
8Jul 16, 2026 08:003,76639,361,24530,237,0001,029,0002,113,536
9Jul 16, 2026 08:003,85940,759,74731,028,0001,008,0002,113,536