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 listJul 30, 2026 17:48CodeReclaimersCodeReclaimersScore: 15,247Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 17:4915,111135,444,402123,310,0002,113,0002,113,536
2Jul 30, 2026 17:4915,197136,338,245123,926,0002,217,0002,113,536
3Jul 30, 2026 17:4915,200136,229,290123,965,0002,197,0002,113,536
4Jul 30, 2026 17:4915,211136,306,090124,146,0002,112,0002,113,536
5Jul 30, 2026 17:4915,247136,560,432124,428,0002,127,0002,113,536
6Jul 30, 2026 17:4915,254136,713,783124,461,0002,152,0002,113,536
7Jul 30, 2026 17:4915,282136,884,324124,724,0002,118,0002,113,536
8Jul 30, 2026 17:4915,301137,058,752124,859,0002,142,0002,113,536
9Jul 30, 2026 17:4915,342137,520,074125,126,0002,217,0002,113,536