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 01:22Victor MerckléVictor MerckléScore: 3,775Success
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 01:223,74540,083,47829,959,0001,131,0002,113,536
2Aug 27, 2026 01:223,76339,530,84730,160,0001,074,0002,113,536
3Aug 27, 2026 01:223,76639,424,15230,159,0001,106,0002,113,536
4Aug 27, 2026 01:223,77239,537,92230,191,0001,121,0002,113,536
5Aug 27, 2026 01:223,77540,343,43730,181,0001,154,0002,113,536
6Aug 27, 2026 01:223,78039,674,32530,328,0001,049,0002,113,536
7Aug 27, 2026 01:223,78540,439,44330,274,0001,145,0002,113,536
8Aug 27, 2026 01:223,81039,912,08030,550,0001,076,0002,113,536
9Aug 27, 2026 01:224,00042,306,67232,043,0001,161,0002,113,536