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 06:49Victor MerckléVictor MerckléScore: 4,130Success
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 06:494,08643,018,62432,794,0001,124,0002,113,536
2Aug 27, 2026 06:494,10843,185,70932,942,0001,156,0002,113,536
3Aug 27, 2026 06:494,11642,583,17933,041,0001,125,0002,113,536
4Aug 27, 2026 06:494,12443,275,90833,124,0001,109,0002,113,536
5Aug 27, 2026 06:494,13042,613,51133,235,0001,048,0002,113,536
6Aug 27, 2026 06:494,13242,647,42533,225,0001,071,0002,113,536
7Aug 27, 2026 06:494,13742,688,86833,223,0001,115,0002,113,536
8Aug 27, 2026 06:494,25743,764,00634,274,0001,066,0002,113,536
9Aug 27, 2026 06:494,42844,874,48735,681,0001,072,0002,113,536