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 12, 2026 14:50Victor MerckléVictor MerckléScore: 3,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 14:513,85140,369,74930,877,0001,089,0002,117,632stderr
2Aug 12, 2026 14:513,85240,391,48530,843,0001,136,0002,117,632stderr
3Aug 12, 2026 14:513,85440,429,90730,926,0001,066,0002,117,632stderr
4Aug 12, 2026 14:513,86240,532,42730,903,0001,159,0002,117,632stderr
5Aug 12, 2026 14:513,87240,940,50731,068,0001,071,0002,117,632stderr
6Aug 12, 2026 14:513,87640,544,21331,015,0001,157,0002,117,632stderr
7Aug 12, 2026 14:513,88940,688,71231,162,0001,123,0002,117,632stderr
8Aug 12, 2026 14:513,89840,725,70931,244,0001,111,0002,117,632stderr
9Aug 12, 2026 14:513,90440,784,38131,320,0001,091,0002,117,632stderr