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 11:58Victor MerckléVictor MerckléScore: 4,196Success
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 11:594,16642,520,54633,467,0001,111,0002,113,536
2Jun 25, 2026 11:594,17642,151,25333,558,0001,105,0002,113,536
3Jun 25, 2026 11:594,19142,450,05233,702,0001,091,0002,113,536
4Jun 25, 2026 11:594,19342,383,72633,718,0001,085,0002,113,536
5Jun 25, 2026 11:594,19643,150,37733,711,0001,117,0002,113,536
6Jun 25, 2026 11:594,19842,299,37133,814,0001,034,0002,113,536
7Jun 25, 2026 11:594,19942,440,73833,781,0001,072,0002,113,536
8Jun 25, 2026 11:594,20342,489,34133,795,0001,091,0002,113,536
9Jun 25, 2026 11:594,21742,539,06333,915,0001,089,0002,113,536