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:00Josu 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:01040,280,38831,224,0001,114,0002,113,536expected "53685269012674247 ", got "53685269093197951 "
2May 11, 2026 18:013,84539,341,85130,883,0001,031,0002,113,536
3May 11, 2026 18:013,88239,848,09031,128,0001,098,0002,113,536
4May 11, 2026 18:013,88439,993,98331,137,0001,107,0002,113,536
5May 11, 2026 18:013,88639,805,36931,146,0001,114,0002,113,536
6May 11, 2026 18:013,90740,605,48231,321,0001,111,0002,113,536
7May 11, 2026 18:013,91639,968,74531,410,0001,093,0002,113,536
8May 11, 2026 18:013,92042,683,65031,435,0001,105,0002,113,536
9May 11, 2026 18:013,95142,848,67231,704,0001,095,0002,113,536