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 08:49Victor MerckléVictor MerckléScore: 6,237Success
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 08:506,21359,937,51250,491,0001,081,0002,113,536
2Aug 27, 2026 08:506,21659,968,16150,514,0001,084,0002,113,536
3Aug 27, 2026 08:506,22060,680,02850,545,0001,082,0002,113,536
4Aug 27, 2026 08:506,23060,121,76950,617,0001,096,0002,113,536
5Aug 27, 2026 08:506,23760,846,90050,683,0001,089,0002,113,536
6Aug 27, 2026 08:506,24360,257,49350,794,0001,029,0002,113,536
7Aug 27, 2026 08:506,25360,269,34150,850,0001,055,0002,113,536
8Aug 27, 2026 08:506,30460,703,59951,278,0001,053,0002,113,536
9Aug 27, 2026 08:506,40561,563,87852,125,0001,042,0002,113,536