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 22, 2025 17:31Valentin KofmanValentin KofmanScore: 23,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 17:3123,831226,495,743195,798,0001,997,0002,404,352
2Jun 22, 2025 17:3123,843223,327,570195,896,0001,998,0002,404,352
3Jun 22, 2025 17:3123,843223,928,975196,896,000999,0002,273,280
4Jun 22, 2025 17:3123,847221,903,901196,928,000999,0002,273,280
5Jun 22, 2025 17:3123,849222,859,198196,951,000999,0002,404,352
6Jun 22, 2025 17:3123,852221,795,176196,974,000999,0002,273,280
7Jun 22, 2025 17:3123,856222,620,071197,003,0001,000,0002,404,352
8Jun 22, 2025 17:3123,860221,038,663197,039,0001,000,0002,404,352
9Jun 22, 2025 17:3123,860224,927,960196,041,0002,000,0002,387,968