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 30, 2025 20:27CCScore: 51,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2025 20:2751,131452,906,315423,389,0001,000,0002,289,664
2Jun 30, 2025 20:2751,137449,664,785423,439,0001,001,0002,269,184
3Jun 30, 2025 20:2751,139454,834,281423,453,0001,001,0002,281,472
4Jun 30, 2025 20:2751,140455,699,368423,457,0001,001,0002,269,184
5Jun 30, 2025 20:2751,143450,957,003423,488,0001,001,0002,281,472
6Jun 30, 2025 20:2751,160448,602,372423,623,0001,001,0002,281,472
7Jun 30, 2025 20:2751,161450,239,187423,640,000999,0002,289,664
8Jun 30, 2025 20:2751,182447,667,926422,811,0001,999,0002,289,664
9Jun 30, 2025 20:2751,188447,223,110423,860,000999,0002,277,376