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 listMay 15, 2026 12:12wnwnScore: 3,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 12:123,29336,053,72027,340,00002,113,536
2May 15, 2026 12:123,30435,175,43727,424,00002,113,536
3May 15, 2026 12:123,30536,528,69826,412,0001,026,0002,113,536
4May 15, 2026 12:123,31137,134,65826,470,0001,017,0002,113,536
5May 15, 2026 12:123,32236,838,85126,570,0001,008,0002,113,536
6May 15, 2026 12:123,32436,956,93527,595,00002,113,536
7May 15, 2026 12:123,39336,485,53928,162,00002,113,536
8May 15, 2026 12:123,48938,599,19827,944,0001,017,0002,113,536
9May 15, 2026 12:123,49638,051,21929,019,00002,113,536