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 listApr 23, 2025 11:52Emanuele BolognesiEmanuele BolognesiScore: 65,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 11:5265,384568,477,822540,692,0001,998,0002,359,296
2Apr 23, 2025 11:5265,387570,276,750541,714,000999,0002,363,392
3Apr 23, 2025 11:5265,392571,296,538541,752,000999,0002,359,296
4Apr 23, 2025 11:5265,395573,271,526541,781,000999,0002,285,568
5Apr 23, 2025 11:5265,398568,634,774541,808,000999,0002,285,568
6Apr 23, 2025 11:5265,404566,781,714541,858,000999,0002,285,568
7Apr 23, 2025 11:5265,410566,581,868541,904,000999,0002,355,200
8Apr 23, 2025 11:5265,431568,456,787543,081,00002,281,472
9Apr 23, 2025 11:5265,442567,431,346542,167,0001,000,0002,285,568