Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listOct 12, 2026 20:41Karthik ReddyKarthik ReddyScore: 23,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 20:4223,657125,709,906114,864,0001,060,00020,480
2Oct 12, 2026 20:4223,672124,885,704114,923,0001,070,00020,480
3Oct 12, 2026 20:4223,698125,079,655115,060,0001,065,00020,480
4Oct 12, 2026 20:4223,721127,169,421115,192,0001,042,00020,480
5Oct 12, 2026 20:4223,725125,136,659115,212,0001,044,00020,480
6Oct 12, 2026 20:4223,732125,250,601115,224,0001,066,00020,480
7Oct 12, 2026 20:4223,781125,487,308115,461,0001,070,00020,480
8Oct 12, 2026 20:4223,937126,194,233116,228,0001,065,00020,480
9Oct 12, 2026 20:4223,954126,304,456116,324,0001,053,00020,480