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 28, 2026 09:19Victor MerckléVictor MerckléScore: 6,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 09:216,78464,116,41755,202,0001,109,0002,113,536
2Jun 28, 2026 09:216,78665,529,87555,244,0001,084,0002,113,536
3Jun 28, 2026 09:216,78764,088,92555,252,0001,083,0002,113,536
4Jun 28, 2026 09:216,79464,098,43055,302,0001,095,0002,113,536
5Jun 28, 2026 09:216,83864,541,12455,743,0001,018,0002,113,536
6Jun 28, 2026 09:216,84064,661,97355,765,0001,012,0002,113,536
7Jun 28, 2026 09:216,84964,605,61355,845,0001,009,0002,113,536
8Jun 28, 2026 09:216,85464,744,39555,860,0001,035,0002,113,536
9Jun 28, 2026 09:216,88864,842,86556,170,0001,003,0002,113,536