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 listMay 11, 2026 18:07Josu San MartinJosu San MartinError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 18:07040,226,33031,243,0001,043,0002,113,536expected "53686322657922637 ", got "53686322401922637 "
2May 11, 2026 18:073,86241,445,72930,980,0001,082,0002,113,536
3May 11, 2026 18:073,86540,997,19730,997,0001,089,0002,113,536
4May 11, 2026 18:073,87539,907,05931,068,0001,101,0002,113,536
5May 11, 2026 18:073,87939,507,10331,033,0001,164,0002,113,536
6May 11, 2026 18:073,87939,495,79531,095,0001,102,0002,113,536
7May 11, 2026 18:073,89039,608,87831,204,0001,085,0002,113,536
8May 11, 2026 18:073,90440,073,99931,329,0001,075,0002,113,536
9May 11, 2026 18:073,93941,810,36831,592,0001,109,0002,113,536