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 listFeb 24, 2026 17:17Mikołaj UzarskiMikołaj UzarskiScore: 5,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 18:425,45069,041,10340,206,0005,025,0002,355,200
2Feb 24, 2026 17:215,48971,381,60442,523,0003,037,0002,457,600
3Feb 24, 2026 17:215,49074,356,90741,518,0004,050,0002,510,848
4Feb 24, 2026 19:005,51472,443,99340,790,0004,974,0002,514,944
5Feb 24, 2026 19:005,51675,534,54839,810,0005,971,0002,437,120
6Feb 24, 2026 19:005,52568,511,97639,877,0005,981,0002,306,048
7Feb 24, 2026 18:425,53869,119,96440,969,0004,996,0002,482,176
8Feb 24, 2026 17:215,54467,824,56841,014,0005,001,0002,322,432
9Feb 24, 2026 18:425,59869,334,63941,417,0005,050,0002,502,656