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:30Karthik 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:300313,696,377303,587,0001,016,0002,113,536expected "53684843178308065 ", got "2566 2520 2521 2518 2521 2522 2515 2519 2521 2518 2521 2520 72 "
2Oct 2, 2026 15:300312,834,259302,660,0001,075,0002,113,536expected "53688665814721333 ", got "2555 2512 2515 2510 2514 2512 2509 2511 2514 2511 2514 2526 148 "
3Oct 2, 2026 15:300312,900,918302,904,0001,041,0002,113,536expected "53689586004289216 ", got "2531 2515 2518 2515 2517 2518 2514 2516 2521 2515 2518 2518 0 "