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 2, 2026 16:58Josu San MartinJosu San MartinScore: 5,926Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 16:585,88177,185,85147,814,000996,0002,293,760
2Jan 2, 2026 16:585,91075,997,44447,051,0002,002,0002,363,392
3Jan 2, 2026 16:585,91178,561,88148,060,0001,001,0002,506,752
4Jan 2, 2026 16:585,92675,375,38947,181,0002,007,0002,281,472
5Jan 2, 2026 16:585,94574,576,38649,343,00002,363,392
6Jan 2, 2026 16:586,04174,785,35348,133,0002,005,0002,371,584