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 3, 2026 05:17limanjun99limanjun99Score: 5,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 05:175,32964,005,12741,222,0003,016,0002,400,256
2May 3, 2026 05:175,33060,600,59041,155,0003,086,0002,428,928
3May 3, 2026 05:175,33161,392,22740,228,0004,022,0002,437,120
4May 3, 2026 05:175,33457,917,68341,261,0003,019,0002,428,928
5May 3, 2026 05:175,34064,975,26840,300,0004,030,0002,433,024
6May 3, 2026 05:175,35964,322,84341,453,0003,033,0002,428,928
7May 3, 2026 05:175,36460,282,26639,469,0005,060,0002,428,928
8May 3, 2026 05:175,38962,172,01340,755,0003,976,0002,433,024
9May 3, 2026 05:175,42664,888,62241,040,0004,003,0002,428,928