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 31, 2026 18:24George SeabridgeGeorge SeabridgeScore: 8,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 18:258,81283,137,90472,064,0001,080,0002,113,536
2Jul 31, 2026 18:258,81983,210,29872,118,0001,087,0002,113,536
3Jul 31, 2026 18:258,85983,692,40472,449,0001,081,0002,113,536
4Jul 31, 2026 18:258,86483,656,46972,487,0001,087,0002,113,536
5Jul 31, 2026 18:258,86983,591,75372,520,0001,093,0002,113,536
6Jul 31, 2026 18:258,89183,777,40772,703,0001,097,0002,113,536
7Jul 31, 2026 18:258,91083,974,48472,865,0001,094,0002,113,536
8Jul 31, 2026 18:258,91083,971,09472,852,0001,106,0002,113,536
9Jul 31, 2026 18:258,91484,014,62372,893,0001,096,0002,113,536