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 8, 2026 18:34Mikołaj UzarskiMikołaj UzarskiScore: 16,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 18:3416,182163,668,825116,404,00017,908,0002,293,760
2Feb 8, 2026 18:3416,218161,160,046119,650,00014,956,0002,383,872
3Feb 8, 2026 18:3416,225159,877,925120,703,00013,965,0002,359,296
4Feb 8, 2026 18:3416,257162,405,792117,944,00016,992,0002,334,720
5Feb 8, 2026 18:3416,281160,362,547118,117,00017,016,0002,412,544
6Feb 8, 2026 18:3416,310167,642,189112,479,00022,894,0002,387,968
7Feb 8, 2026 18:3416,310166,452,385118,455,00016,922,0002,457,600
8Feb 8, 2026 18:3416,318164,495,333116,518,00018,921,0002,523,136
9Feb 8, 2026 18:3416,439161,578,229119,516,00016,931,0002,437,120