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 29, 2026 14:31Victor MerckléVictor MerckléScore: 3,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 14:313,64538,585,48629,198,0001,057,0002,117,632stderr
2Aug 29, 2026 14:313,65038,695,03529,148,0001,153,0002,117,632stderr
3Aug 29, 2026 14:313,66239,426,78029,283,0001,112,0002,117,632stderr
4Aug 29, 2026 14:313,66645,223,56129,269,0001,166,0002,117,632stderr
5Aug 29, 2026 14:313,67038,775,48629,342,0001,121,0002,117,632stderr
6Aug 29, 2026 14:313,67939,612,00229,329,0001,207,0002,117,632stderr
7Aug 29, 2026 14:313,68739,606,76829,482,0001,125,0002,117,632stderr
8Aug 29, 2026 14:313,70539,199,17929,691,0001,065,0002,117,632stderr
9Aug 29, 2026 14:313,70645,895,58929,600,0001,163,0002,117,632stderr