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 listSep 8, 2026 18:09Victor MerckléVictor MerckléScore: 3,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 18:143,65338,876,47829,267,0001,057,0002,121,728stderr
2Sep 8, 2026 18:143,69139,190,71229,586,0001,052,0002,121,728stderr
3Sep 8, 2026 18:143,69239,124,85529,623,0001,024,0002,121,728stderr
4Sep 8, 2026 18:143,71039,426,60829,735,0001,060,0002,121,728stderr
5Sep 8, 2026 18:143,71139,183,20329,750,0001,056,0002,121,728stderr
6Sep 8, 2026 18:143,71339,697,80629,770,0001,055,0002,121,728stderr
7Sep 8, 2026 18:143,71347,766,13629,751,0001,072,0002,121,728stderr
8Sep 8, 2026 18:143,72039,330,24729,813,0001,069,0002,121,728stderr
9Sep 8, 2026 18:143,72641,325,60929,872,0001,062,0002,121,728stderr