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 19, 2026 15:17Victor MerckléVictor MerckléScore: 9,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 15:179,68287,885,18279,318,0001,045,0002,113,536
2Jun 19, 2026 15:179,68687,929,70779,314,0001,083,0002,113,536
3Jun 19, 2026 15:179,68787,852,59379,312,0001,094,0002,113,536
4Jun 19, 2026 15:179,68889,171,17979,383,0001,029,0002,113,536
5Jun 19, 2026 15:179,68987,861,82679,382,0001,042,0002,113,536
6Jun 19, 2026 15:179,69687,970,47679,411,0001,066,0002,113,536
7Jun 19, 2026 15:179,69987,933,46479,447,0001,055,0002,113,536
8Jun 19, 2026 15:179,72988,184,70379,740,0001,016,0002,113,536
9Jun 19, 2026 15:179,73688,281,12679,695,0001,121,0002,113,536