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 listOct 2, 2026 16:20Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 16:210320,278,667310,148,0001,094,0002,113,536expected "53684613911595984 ", got "2589 2572 2584 2573 2571 2583 2573 2574 2584 2575 2573 2584 "
2Oct 2, 2026 16:210320,523,274310,357,0001,093,0002,113,536expected "53692334977172395 ", got "2587 2573 2578 2570 2603 2582 2574 2584 2581 2572 2572 2578 "
3Oct 2, 2026 16:210322,692,699312,665,0001,034,0002,113,536expected "53690472771125367 ", got "2604 2588 2612 2588 2590 2607 2586 2594 2607 2587 2591 2623 "