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 listApr 24, 2026 06:51olliecrowolliecrowScore: 78,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 06:5378,394665,210,917648,679,0001,999,0002,310,144
2Apr 24, 2026 06:5378,399659,286,249648,715,0002,002,0002,375,680
3Apr 24, 2026 06:5378,402668,414,904648,739,0001,999,0002,375,680
4Apr 24, 2026 06:5378,403672,319,109648,751,0001,999,0002,322,432
5Apr 24, 2026 06:5378,405668,377,867648,769,0001,999,0002,310,144
6Apr 24, 2026 06:5378,431659,571,695647,981,0002,999,0002,318,336
7Apr 24, 2026 06:5378,444659,731,713650,090,0001,000,0002,379,776
8Apr 24, 2026 06:5378,524659,598,141647,752,0003,998,0002,359,296
9Apr 24, 2026 06:5378,535659,323,237647,847,0003,999,0002,379,776