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 12:25Victor MerckléVictor MerckléScore: 3,850Success
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 12:263,76039,477,56329,974,0001,234,0002,113,536
2Aug 27, 2026 12:263,76839,461,10730,095,0001,180,0002,113,536
3Aug 27, 2026 12:263,77639,691,20630,069,0001,277,0002,113,536
4Aug 27, 2026 12:263,80340,649,40030,275,0001,290,0002,113,536
5Aug 27, 2026 12:263,85041,726,51530,657,0001,306,0002,113,536
6Aug 27, 2026 12:263,87241,257,18231,111,0001,027,0002,113,536
7Aug 27, 2026 12:263,89240,575,05231,128,0001,179,0002,113,536
8Aug 27, 2026 12:263,91841,462,48031,303,0001,219,0002,113,536
9Aug 27, 2026 12:263,93441,639,55931,410,0001,250,0002,113,536