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 19, 2026 17:34A_ShamanA_ShamanScore: 44,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 17:3444,069375,018,895283,194,00082,585,0002,113,536
2Jun 19, 2026 17:3444,131375,494,130283,020,00083,269,0002,113,536
3Jun 19, 2026 17:3444,134375,469,531282,993,00083,325,0002,113,536
4Jun 19, 2026 17:3444,144375,533,823283,144,00083,257,0002,113,536
5Jun 19, 2026 17:3444,176375,929,386283,069,00083,595,0002,113,536
6Jun 19, 2026 17:3444,276376,660,237283,078,00084,414,0002,113,536
7Jun 19, 2026 17:3444,326377,733,700283,079,00084,834,0002,113,536
8Jun 19, 2026 17:3444,364377,503,743283,105,00085,119,0002,113,536
9Jun 19, 2026 17:3444,536379,911,655283,644,00086,009,0002,113,536