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 19:05CCScore: 56,678Success
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 19:0356,634494,046,989468,064,0002,000,0002,273,280
2Jun 30, 2025 19:0356,651492,128,284468,200,0002,000,0002,289,664
3Jun 30, 2025 19:0356,653492,854,050469,219,0001,000,0002,273,280
4Jun 30, 2025 19:0356,656495,285,272469,246,0001,000,0002,281,472
5Jun 30, 2025 19:0356,665501,967,175469,322,0001,000,0002,281,472
6Jun 30, 2025 19:0356,676495,563,977469,413,0001,000,0002,285,568
7Jun 30, 2025 19:0556,678498,716,200470,427,00002,277,376
8Jun 30, 2025 19:0356,680497,028,146469,448,0001,000,0002,289,664
9Jun 30, 2025 19:0356,699496,759,501469,603,000999,0002,281,472
10Jun 30, 2025 19:0556,699501,023,845468,603,0001,998,0002,289,664
11Jun 30, 2025 19:0556,704499,385,031468,645,0001,998,0002,277,376
12Jun 30, 2025 19:0356,710498,252,716468,699,0001,998,0002,277,376