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 listSep 17, 2025 19:10sheryllynn24sheryllynn24Score: 30,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2025 19:1030,841285,959,353252,983,0002,999,0002,277,376
2Sep 17, 2025 19:1030,844284,787,519254,004,0002,000,0002,273,280
3Sep 17, 2025 19:1030,853281,326,641254,079,0002,000,0002,277,376
4Sep 17, 2025 19:1030,871285,990,761254,227,0002,001,0002,519,040
5Sep 17, 2025 19:1030,880281,922,508253,297,0003,003,0002,510,848
6Sep 17, 2025 19:1030,893285,471,881255,414,0001,001,0002,273,280
7Sep 17, 2025 19:1030,896281,985,888256,433,00002,277,376
8Sep 17, 2025 19:1030,916283,217,146252,606,0003,993,0002,523,136
9Sep 17, 2025 19:1031,471292,497,116258,207,0003,002,0002,277,376