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 listOct 23, 2026 09:25WangWangScore: 56,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2026 09:2655,043468,122,051455,794,0001,071,0002,113,536
2Oct 23, 2026 09:2655,045467,711,926455,694,0001,182,0002,113,536
3Oct 23, 2026 09:2655,056467,710,276455,896,0001,070,0002,113,536
4Oct 23, 2026 09:2655,080469,256,519455,941,0001,228,0002,113,536
5Oct 23, 2026 09:2656,195477,239,019465,266,0001,154,0002,113,536
6Oct 23, 2026 09:2656,206477,310,723465,421,0001,094,0002,113,536
7Oct 23, 2026 09:2656,209477,870,881465,470,0001,070,0002,113,536
8Oct 23, 2026 09:2656,213477,496,840465,338,0001,235,0002,113,536
9Oct 23, 2026 09:2656,214477,953,250465,410,0001,168,0002,113,536