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 27, 2026 23:32A_ShamanA_ShamanScore: 44,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 23:3344,524378,817,161368,483,0001,069,0002,113,536
2Jun 27, 2026 23:3344,529378,851,023368,515,0001,077,0002,113,536
3Jun 27, 2026 23:3344,531378,928,959368,584,0001,026,0002,113,536
4Jun 27, 2026 23:3344,533378,890,582368,565,0001,066,0002,113,536
5Jun 27, 2026 23:3344,535379,006,416368,584,0001,064,0002,113,536
6Jun 27, 2026 23:3344,541378,960,593368,631,0001,064,0002,113,536
7Jun 27, 2026 23:3344,554379,044,955368,793,0001,011,0002,113,536
8Jun 27, 2026 23:3344,557379,120,029368,698,0001,128,0002,113,536
9Jun 27, 2026 23:3344,568379,279,577368,912,0001,003,0002,113,536