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 24, 2026 22:56Victor MerckléVictor MerckléScore: 4,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 22:574,24642,787,37334,144,0001,102,0002,113,536
2Jun 24, 2026 22:574,25143,255,41134,190,0001,098,0002,113,536
3Jun 24, 2026 22:574,25242,931,78134,203,0001,092,0002,113,536
4Jun 24, 2026 22:574,25642,787,58034,234,0001,099,0002,113,536
5Jun 24, 2026 22:574,25642,925,55034,231,0001,100,0002,113,536
6Jun 24, 2026 22:574,26544,313,59834,270,0001,130,0002,113,536
7Jun 24, 2026 22:574,28443,555,37434,468,0001,096,0002,113,536
8Jun 24, 2026 22:574,31443,704,63834,716,0001,091,0002,113,536
9Jun 24, 2026 22:574,32943,738,17134,840,0001,096,0002,113,536