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 listJan 3, 2026 03:21Josu San MartinJosu San MartinScore: 6,277Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 03:215,57467,882,17645,256,0001,005,0002,289,664
2Jan 3, 2026 03:215,95975,719,19648,451,0001,009,0002,490,368
3Jan 3, 2026 03:216,17978,784,35450,278,0001,005,0002,506,752
4Jan 3, 2026 03:216,27777,577,55952,096,00002,301,952
5Jan 3, 2026 03:216,61082,358,32551,874,0002,992,0002,273,280
6Jan 3, 2026 03:216,64075,595,85053,109,0002,004,0002,265,088