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 listJun 22, 2025 15:08thatmagicalcatthatmagicalcatScore: 52,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 15:0852,733468,628,189435,685,0001,998,0002,285,568
2Jun 22, 2025 15:0852,736468,194,032435,707,0001,998,0002,355,200
3Jun 22, 2025 15:0852,739464,239,759435,736,0001,998,0002,363,392
4Jun 22, 2025 15:0852,746467,793,097436,790,000999,0002,285,568
5Jun 22, 2025 15:0852,992471,957,203438,832,000999,0002,285,568
6Jun 22, 2025 15:0853,008462,319,536438,966,000999,0002,285,568