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 15:05Victor MerckléVictor MerckléScore: 17,356Success
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 15:0617,307151,120,191142,573,0001,076,0002,113,536
2Jun 25, 2026 15:0617,320151,365,971142,754,0001,008,0002,113,536
3Jun 25, 2026 15:0617,334151,414,397142,793,0001,080,0002,113,536
4Jun 25, 2026 15:0617,354151,538,597142,948,0001,092,0002,113,536
5Jun 25, 2026 15:0617,356152,872,678143,060,0001,002,0002,113,536
6Jun 25, 2026 15:0617,364151,597,240143,084,0001,039,0002,113,536
7Jun 25, 2026 15:0617,370151,637,544143,163,0001,009,0002,113,536
8Jun 25, 2026 15:0617,378151,921,580143,223,0001,021,0002,113,536
9Jun 25, 2026 15:0617,380151,688,749143,178,0001,083,0002,113,536