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 16:23Josu 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 16:24041,808,96831,103,0001,082,0002,113,536expected "53691978300099959 ", got "53691978044099959 "
2May 11, 2026 16:243,87039,707,58431,013,0001,116,0002,113,536
3May 11, 2026 16:243,87539,871,07731,059,0001,106,0002,113,536
4May 11, 2026 16:243,88641,326,03131,178,0001,082,0002,113,536
5May 11, 2026 16:243,89039,933,26431,171,0001,118,0002,113,536
6May 11, 2026 16:243,90040,074,16331,281,0001,097,0002,113,536
7May 11, 2026 16:243,91240,437,07631,363,0001,114,0002,113,536
8May 11, 2026 16:243,91339,999,98531,356,0001,125,0002,113,536
9May 11, 2026 16:243,95040,331,78931,682,0001,107,0002,113,536