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 10, 2026 19:04Josu 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 10, 2026 19:05044,726,97836,239,0001,005,0002,113,536expected "53694434773652256 ", got "53694434517652256 "
2May 10, 2026 19:054,49545,641,24236,242,0001,073,0002,113,536
3May 10, 2026 19:054,50445,699,67336,317,0001,072,0002,113,536
4May 10, 2026 19:054,50545,864,45736,309,0001,090,0002,113,536
5May 10, 2026 19:054,50746,381,19936,326,0001,090,0002,113,536
6May 10, 2026 19:054,51647,556,77636,397,0001,086,0002,113,536
7May 10, 2026 19:054,52146,548,74936,482,0001,046,0002,113,536
8May 10, 2026 19:054,52847,783,21836,498,0001,090,0002,113,536
9May 10, 2026 19:054,58548,284,71036,981,0001,079,0002,113,536