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 29, 2026 09:10Adam FolwarcznyAdam FolwarcznyScore: 13,940Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 09:1113,594122,128,121111,699,0001,139,0002,113,536
2Jun 29, 2026 09:1113,810123,953,671113,469,0001,161,0002,113,536
3Jun 29, 2026 09:1113,817124,073,449113,529,0001,159,0002,113,536
4Jun 29, 2026 09:1113,908125,964,150114,330,0001,107,0002,113,536
5Jun 29, 2026 09:1113,940125,046,049114,703,0001,005,0002,113,536
6Jun 29, 2026 09:1114,043125,885,061115,412,0001,151,0002,113,536
7Jun 29, 2026 09:1114,092126,323,532115,818,0001,147,0002,113,536
8Jun 29, 2026 09:1114,103126,425,467116,044,0001,012,0002,113,536
9Jun 29, 2026 09:1114,682131,929,041120,697,0001,171,0002,113,536