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 13, 2026 15:58Victor MerckléVictor MerckléScore: 7,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 15:587,94074,998,66864,863,0001,040,0002,113,536
2May 13, 2026 15:587,94573,213,41064,945,0001,001,0002,113,536
3May 13, 2026 15:587,94674,754,86764,956,0001,004,0002,113,536
4May 13, 2026 15:587,94973,427,65464,978,0001,005,0002,113,536
5May 13, 2026 15:587,95077,580,66664,968,0001,021,0002,113,536
6May 13, 2026 15:587,95173,290,26964,971,0001,030,0002,113,536
7May 13, 2026 15:587,95175,319,72564,964,0001,032,0002,113,536
8May 13, 2026 15:587,95473,891,73964,943,0001,076,0002,113,536
9May 13, 2026 15:587,95874,345,68965,031,0001,028,0002,113,536