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 29, 2026 14:07Adam FolwarcznyAdam FolwarcznyScore: 8,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 14:098,90783,414,44172,810,0001,124,0002,113,536
2Jun 29, 2026 14:098,91683,558,45472,794,0001,217,0002,113,536
3Jun 29, 2026 14:098,91784,194,97172,815,0001,204,0002,113,536
4Jun 29, 2026 14:098,91783,544,93672,796,0001,223,0002,113,536
5Jun 29, 2026 14:098,92783,662,04472,868,0001,228,0002,113,536
6Jun 29, 2026 14:098,92783,620,50072,867,0001,230,0002,113,536
7Jun 29, 2026 14:098,93483,887,30872,888,0001,271,0002,113,536
8Jun 29, 2026 14:098,94184,141,70173,205,0001,010,0002,113,536
9Jun 29, 2026 14:099,00084,201,70573,568,0001,137,0002,113,536