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 10, 2026 12:13Victor MerckléVictor MerckléScore: 5,477Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 12:145,43553,510,00244,067,0001,046,0002,117,632stderr
2Aug 10, 2026 12:145,45553,656,34943,998,0001,284,0002,117,632stderr
3Aug 10, 2026 12:145,45954,396,30744,305,0001,012,0002,117,632stderr
4Aug 10, 2026 12:145,47554,480,60044,432,0001,012,0002,117,632stderr
5Aug 10, 2026 12:145,47753,920,15744,450,0001,011,0002,117,632stderr
6Aug 10, 2026 12:145,47854,575,38144,447,0001,027,0002,117,632stderr
7Aug 10, 2026 12:145,48354,558,99844,494,0001,016,0002,117,632stderr
8Aug 10, 2026 12:145,48453,882,21344,503,0001,018,0002,117,632stderr
9Aug 10, 2026 12:145,48553,942,07444,510,0001,021,0002,117,632stderr