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 9, 2026 20:57Karthik 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 9, 2026 20:570482,335,480470,729,0001,001,0002,113,536expected "53689743357836193 ", got "PROBE size=524129041 cnt=50000000 sum=53689743357836193 hash=fbae770496fe0ecc first=356786903,1118042461,1994635353,36725750,171024567,1776221112 "
2Oct 9, 2026 20:570481,088,005469,202,0001,270,0002,113,536expected "53684263850009627 ", got "PROBE size=524127241 cnt=50000000 sum=53684263850009627 hash=55a484239f3ac6ba first=252904250,963977565,220334939,1008791459,1813558946,202951782 "
3Oct 9, 2026 20:570482,446,072470,610,0001,012,0002,113,536expected "53682698870974874 ", got "PROBE size=524129502 cnt=50000000 sum=53682698870974874 hash=08460007dd31719f first=1164676418,1512569075,582815438,1043942761,533038173,1391161184 "