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 11:30Victor MerckléVictor MerckléScore: 4,164Success
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 11:314,13742,036,50133,240,0001,098,0002,113,536
2Jun 26, 2026 11:314,14142,044,09933,275,0001,103,0002,113,536
3Jun 26, 2026 11:314,15442,126,47133,377,0001,107,0002,113,536
4Jun 26, 2026 11:314,16042,215,32533,518,0001,015,0002,113,536
5Jun 26, 2026 11:314,16442,594,44533,454,0001,110,0002,113,536
6Jun 26, 2026 11:314,16542,243,58433,480,0001,092,0002,113,536
7Jun 26, 2026 11:314,16842,295,30033,565,0001,030,0002,113,536
8Jun 26, 2026 11:314,19542,543,33133,715,0001,107,0002,113,536
9Jun 26, 2026 11:314,29143,308,08334,610,0001,006,0002,113,536