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 12, 2026 00:09Josu 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 12, 2026 00:10043,911,11232,662,0001,055,0002,113,536expected "53679730574474286 ", got "53679726776538888 "
2May 12, 2026 00:104,02542,625,93132,405,0001,006,0002,113,536
3May 12, 2026 00:104,02542,256,30532,382,0001,033,0002,113,536
4May 12, 2026 00:104,02841,481,75932,427,0001,006,0002,113,536
5May 12, 2026 00:104,04242,791,92532,447,0001,103,0002,113,536
6May 12, 2026 00:104,04245,485,33932,440,0001,110,0002,113,536
7May 12, 2026 00:104,04242,948,19732,529,0001,024,0002,113,536
8May 12, 2026 00:104,05442,087,90332,618,0001,031,0002,113,536
9May 12, 2026 00:107,34970,233,05459,856,0001,143,0002,113,536