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 11:27Karthik 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 11:2801,319,867,8291,265,328,00045,475,0002,113,536expected "53687753441257658 ", got "2639 2564 2594 2563 2597 2563 2595 2564 "
2Oct 2, 2026 11:2801,321,436,6821,265,505,00045,632,0002,113,536expected "53688628134138357 ", got "2642 2566 2614 2566 2601 2563 2599 2564 "
3Oct 2, 2026 11:2801,359,621,2181,299,986,00046,526,0002,113,536expected "53685093948827102 ", got "3038 3000 3054 3019 3063 3010 3066 3019 "