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:32Karthik 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:330242,586,689232,555,0001,094,0002,113,536expected "53683660457479330 ", got "2592 2574!2581!2572 2573!2581!2571 2572!2581! "
2Oct 2, 2026 15:330243,477,295233,342,0001,118,0002,113,536expected "53689208111370129 ", got "2600 2583!2591!2577 2582!2593!2577 2585!2592! "
3Oct 2, 2026 15:330243,831,206233,622,0001,178,0002,113,536expected "53680949929595033 ", got "2598 2586!2598!2575 2587!2600!2576 2600!2599! "