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:11Karthik 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:110242,798,810232,765,0001,002,0002,113,536expected "53688316894742033 ", got "2597 2575!2582!2571 2574!2581!2571 2575!2588! "
2Oct 2, 2026 15:110243,014,263232,945,0001,087,0002,113,536expected "53688498614264745 ", got "2641 2571!2575!2572 2572!2576!2573 2574!2580! "
3Oct 2, 2026 15:110243,742,222233,575,0001,102,0002,113,536expected "53688919178825742 ", got "2602 2585!2593!2578 2589!2593!2579 2586!2594! "