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 listAug 27, 2026 07:24Victor MerckléVictor MerckléScore: 75,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 07:2474,724628,581,952619,115,0001,099,0002,113,536
2Aug 27, 2026 07:2475,263633,114,351623,588,0001,100,0002,113,536
3Aug 27, 2026 07:2475,275634,448,296623,689,0001,098,0002,113,536
4Aug 27, 2026 07:2475,419634,338,078624,904,0001,075,0002,113,536
5Aug 27, 2026 07:2475,500635,117,740625,650,0001,008,0002,113,536
6Aug 27, 2026 07:2476,020639,442,260629,901,0001,071,0002,113,536
7Aug 27, 2026 07:2476,100640,050,338630,444,0001,192,0002,113,536
8Aug 27, 2026 07:2476,642644,931,185635,062,0001,072,0002,113,536
9Aug 27, 2026 07:2476,709645,142,220635,678,0001,010,0002,113,536