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 21, 2026 01:24Andrew EpsteinAndrew EpsteinScore: 4,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 01:244,86350,311,11838,175,0002,190,0002,113,536
2Aug 21, 2026 01:244,86450,356,37838,178,0002,201,0002,113,536
3Aug 21, 2026 01:244,86850,350,01838,212,0002,200,0002,113,536
4Aug 21, 2026 01:244,88050,416,07838,258,0002,250,0002,113,536
5Aug 21, 2026 01:244,88150,450,47038,309,0002,204,0002,113,536
6Aug 21, 2026 01:244,88350,513,66038,487,0002,043,0002,113,536
7Aug 21, 2026 01:245,00151,555,53139,323,0002,190,0002,113,536
8Aug 21, 2026 01:245,03852,464,84039,596,0002,223,0002,113,536
9Aug 21, 2026 01:245,07652,089,12039,910,0002,221,0002,113,536