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 27, 2026 01:27Code HintsCode HintsScore: 6,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 01:286,13758,481,80648,885,0002,056,0002,113,536
2Jun 27, 2026 01:286,19258,964,29248,359,0003,036,0002,113,536
3Jun 27, 2026 01:286,24859,627,12548,781,0003,083,0002,113,536
4Jun 27, 2026 01:286,32860,068,38350,487,0002,042,0002,113,536
5Jun 27, 2026 01:286,36160,536,39249,765,0003,037,0002,113,536
6Jun 27, 2026 01:286,38960,591,27250,971,0002,064,0002,113,536
7Jun 27, 2026 01:286,39060,701,91850,993,0002,044,0002,113,536
8Jun 27, 2026 01:286,41160,951,95350,151,0003,065,0002,113,536
9Jun 27, 2026 01:287,13166,760,31157,134,0002,056,0002,113,536