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 listNov 17, 2025 10:11AndreyAndreyScore: 85,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2025 10:1185,696740,574,980638,350,00072,925,0002,375,680
2Nov 17, 2025 10:1185,725745,971,261639,568,00071,951,0002,383,872
3Nov 17, 2025 10:1185,737744,735,512638,658,00072,961,0002,416,640
4Nov 17, 2025 10:1185,754746,033,903637,787,00073,975,0002,342,912
5Nov 17, 2025 10:1185,785740,701,609641,012,00071,001,0002,473,984
6Nov 17, 2025 10:1185,795739,839,577638,090,00074,010,0002,326,528
7Nov 17, 2025 10:1185,869740,676,615639,739,00072,970,0002,383,872
8Nov 17, 2025 10:1185,959745,615,523638,515,00074,943,0002,363,392
9Nov 17, 2025 10:1186,217741,582,122638,646,00076,957,0002,379,776