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 15:23Karthik 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 15:240243,932,726233,813,0001,116,0002,113,536expected "53685800985869625 ", got "2598 2600 2597 2570 2599 2597 2568 2600 2598 "
2Oct 2, 2026 15:240244,633,222234,547,0001,133,0002,113,536expected "53690515637450923 ", got "2597 2607 2609 2584 2605 2610 2576 2605 2610 "
3Oct 2, 2026 15:240244,220,724234,131,0001,087,0002,113,536expected "53690739019539310 ", got "2592 2604 2603 2571 2602 2604 2570 2601 2606 "