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 25, 2026 17:45Victor MerckléVictor MerckléScore: 4,227Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 17:464,21843,975,39233,932,0001,081,0002,113,536
2Jun 25, 2026 17:464,22142,512,40933,961,0001,079,0002,113,536
3Jun 25, 2026 17:464,22342,574,88533,943,0001,116,0002,113,536
4Jun 25, 2026 17:464,22442,657,28333,969,0001,096,0002,113,536
5Jun 25, 2026 17:464,22742,633,21033,978,0001,112,0002,113,536
6Jun 25, 2026 17:464,23142,748,21134,018,0001,105,0002,113,536
7Jun 25, 2026 17:464,24143,138,35134,098,0001,106,0002,113,536
8Jun 25, 2026 17:464,25642,870,09134,215,0001,117,0002,113,536
9Jun 25, 2026 17:464,25942,944,19534,258,0001,098,0002,113,536