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 10, 2026 06:51Josu San MartinJosu San MartinScore: 4,164Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 06:524,13751,635,19633,228,0001,116,0002,482,176
2May 10, 2026 06:524,14546,774,76033,302,0001,106,0002,482,176
3May 10, 2026 06:524,15051,102,93233,294,0001,157,0002,473,984
4May 10, 2026 06:524,16450,355,88433,496,0001,068,0002,478,080
5May 10, 2026 06:524,16450,103,58633,531,0001,034,0002,482,176
6May 10, 2026 06:524,17552,402,55533,611,0001,042,0002,490,368
7May 10, 2026 06:524,19551,012,26533,706,0001,119,0002,486,272
8May 10, 2026 06:524,22450,066,22533,992,0001,069,0002,469,888
9May 10, 2026 06:524,29948,195,44434,592,0001,091,0002,478,080