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:47Victor MerckléVictor MerckléScore: 7,981Success
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:487,57571,173,77161,775,0001,101,0002,117,632stderr
2Aug 27, 2026 01:487,81473,096,14863,842,0001,020,0002,117,632stderr
3Aug 27, 2026 01:487,89474,320,65864,423,0001,101,0002,117,632stderr
4Aug 27, 2026 01:487,95074,251,43464,950,0001,039,0002,117,632stderr
5Aug 27, 2026 01:487,98174,626,61465,224,0001,020,0002,117,632stderr
6Aug 27, 2026 01:488,00974,751,96465,370,0001,108,0002,117,632stderr
7Aug 27, 2026 01:488,02774,942,86565,609,0001,019,0002,117,632stderr
8Aug 27, 2026 01:488,04075,043,85765,715,0001,021,0002,117,632stderr
9Aug 27, 2026 01:488,05375,184,75965,723,0001,121,0002,117,632stderr