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 24, 2026 13:27Victor MerckléVictor MerckléScore: 9,290Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 13:278,98585,274,91673,564,0001,013,0002,113,536
2May 24, 2026 13:278,98785,460,10873,587,0001,010,0002,113,536
3May 24, 2026 13:279,28688,365,52176,065,0001,011,0002,113,536
4May 24, 2026 13:279,29088,042,30776,101,0001,012,0002,113,536
5May 24, 2026 13:279,29087,524,03076,099,0001,009,0002,113,536
6May 24, 2026 13:279,29086,541,99076,096,0001,011,0002,113,536
7May 24, 2026 13:279,29189,399,81176,105,0001,012,0002,113,536
8May 24, 2026 13:279,29386,892,55376,128,0001,011,0002,113,536
9May 24, 2026 13:279,29686,662,12876,150,0001,011,0002,113,536