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 08: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 08:110194,042,780183,960,0001,061,0002,113,536expected "53689264715011499 ", got "2702 28 999|2596,53 2595,54 2595,53 2593,53 2596,52 2594,52 |0 "
2Oct 2, 2026 08:110194,522,988184,309,0001,127,0002,113,536expected "53685093458830808 ", got "2719 27 999|2600,54 2600,55 2602,54 2599,54 2605,55 2601,55 |0 "
3Oct 2, 2026 08:110195,327,184184,320,0001,148,0002,113,536expected "53689099971269580 ", got "2718 26 999|2603,53 2602,53 2604,53 2603,54 2602,52 2601,54 |0 "