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 26, 2026 23:50Code HintsCode HintsScore: 6,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 23:506,05057,698,11348,164,0002,054,0002,113,536
2Jun 26, 2026 23:506,13558,429,53548,845,0002,077,0002,113,536
3Jun 26, 2026 23:506,16458,635,51049,088,0002,080,0002,113,536
4Jun 26, 2026 23:506,19258,880,94249,348,0002,046,0002,113,536
5Jun 26, 2026 23:506,29459,882,93949,170,0003,073,0002,113,536
6Jun 26, 2026 23:506,36160,285,83250,755,0002,046,0002,113,536
7Jun 26, 2026 23:506,36160,326,68950,727,0002,070,0002,113,536
8Jun 26, 2026 23:506,36260,350,01650,753,0002,059,0002,113,536
9Jun 26, 2026 23:506,45161,395,40150,524,0003,027,0002,113,536