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 listJun 25, 2026 20:24Victor MerckléVictor MerckléScore: 4,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 20:274,91748,866,52639,676,0001,143,0002,113,536
2Jun 25, 2026 20:274,92349,920,82439,812,0001,056,0002,113,536
3Jun 25, 2026 20:274,93748,515,69939,859,0001,119,0002,113,536
4Jun 25, 2026 20:274,94048,937,01639,870,0001,136,0002,113,536
5Jun 25, 2026 20:274,94949,217,26139,966,0001,117,0002,113,536
6Jun 25, 2026 20:274,98049,208,65840,184,0001,158,0002,113,536
7Jun 25, 2026 20:275,05949,482,33440,859,0001,134,0002,113,536
8Jun 25, 2026 20:275,10849,933,59041,364,0001,037,0002,113,536
9Jun 25, 2026 20:275,12650,644,39441,519,0001,035,0002,113,536