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 08:26Victor MerckléVictor MerckléScore: 5,660Success
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 08:265,62955,709,76045,634,0001,094,0002,113,536
2Aug 27, 2026 08:265,64155,155,19145,743,0001,084,0002,113,536
3Aug 27, 2026 08:265,64455,806,11245,759,0001,089,0002,113,536
4Aug 27, 2026 08:265,64555,224,37645,772,0001,083,0002,113,536
5Aug 27, 2026 08:265,66055,968,85045,888,0001,095,0002,113,536
6Aug 27, 2026 08:265,66155,370,87645,920,0001,074,0002,113,536
7Aug 27, 2026 08:265,68955,620,49446,169,0001,052,0002,113,536
8Aug 27, 2026 08:265,70355,714,91846,295,0001,044,0002,113,536
9Aug 27, 2026 08:265,94457,909,13548,218,0001,121,0002,113,536