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 29, 2025 02:16CCScore: 146,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2025 02:16146,2311,236,666,3311,211,718,0001,999,0002,265,088
2Jun 29, 2025 02:16146,2471,239,587,5491,212,850,000999,0002,273,280
3Jun 29, 2025 02:16146,2911,235,827,5881,212,215,0001,998,0002,379,776
4Jun 29, 2025 02:16146,2991,237,726,4701,212,283,0001,998,0002,281,472
5Jun 29, 2025 02:16146,4321,240,059,9761,213,386,0001,998,0002,277,376
6Jun 29, 2025 02:16147,0511,245,210,7721,218,525,0001,999,0002,269,184
7Jun 29, 2025 02:16147,1171,251,005,3201,220,071,0001,000,0002,289,664
8Jun 29, 2025 02:16147,1201,252,382,0241,220,092,0001,000,0002,289,664
9Jun 29, 2025 02:16147,2821,244,679,4331,221,444,000999,0002,519,040