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 07:29Victor MerckléVictor MerckléScore: 7,949Success
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 07:297,94777,801,02264,948,0001,018,0002,113,536
2May 13, 2026 07:297,94874,146,90164,941,0001,033,0002,113,536
3May 13, 2026 07:297,94875,021,67364,945,0001,027,0002,113,536
4May 13, 2026 07:297,94975,381,81764,968,0001,012,0002,113,536
5May 13, 2026 07:297,94973,356,43664,970,0001,012,0002,113,536
6May 13, 2026 07:297,95075,187,39964,969,0001,020,0002,113,536
7May 13, 2026 07:297,95275,031,40064,998,0001,008,0002,113,536
8May 13, 2026 07:297,95373,618,12964,997,0001,015,0002,113,536
9May 13, 2026 07:298,09676,714,64366,179,0001,018,0002,113,536