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 listMar 25, 2026 13:25Dominique GarmierDominique GarmierScore: 94,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 13:1994,237814,975,698781,169,0001,000,0002,478,080
2Mar 25, 2026 13:2594,250806,705,801781,274,0001,000,0002,277,376
3Mar 25, 2026 13:1994,251808,851,259780,282,0001,998,0002,277,376
4Mar 25, 2026 13:1994,265806,744,744780,398,0001,998,0002,277,376
5Mar 25, 2026 13:2594,269810,525,453781,434,000999,0002,277,376
6Mar 25, 2026 13:2594,394807,019,210781,469,0001,998,0002,469,888