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 25, 2026 14:42Victor MerckléVictor MerckléScore: 7,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 14:436,99466,433,57856,961,0001,094,0002,117,632stderr
2Aug 25, 2026 14:437,01266,599,05057,065,0001,139,0002,117,632stderr
3Aug 25, 2026 14:437,02566,799,16357,164,0001,150,0002,117,632stderr
4Aug 25, 2026 14:437,05366,832,48457,441,0001,099,0002,117,632stderr
5Aug 25, 2026 14:437,06567,079,18657,476,0001,169,0002,117,632stderr
6Aug 25, 2026 14:437,07567,172,94957,627,0001,096,0002,117,632stderr
7Aug 25, 2026 14:437,10867,429,54557,893,0001,111,0002,117,632stderr
8Aug 25, 2026 14:437,20268,187,61458,633,0001,148,0002,117,632stderr
9Aug 25, 2026 14:437,38470,115,00160,076,0001,212,0002,117,632stderr