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:35Karthik ReddyKarthik ReddyScore: 23,825Success
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:3523,803127,059,602115,571,0001,064,00020,480
2Oct 12, 2026 20:3523,811125,544,051115,621,0001,054,00020,480
3Oct 12, 2026 20:3523,816125,658,024115,611,0001,092,00020,480
4Oct 12, 2026 20:3523,820125,639,267115,655,0001,067,00020,480
5Oct 12, 2026 20:3523,825125,609,136115,678,0001,066,00020,480
6Oct 12, 2026 20:3523,835127,044,137115,676,0001,117,00020,480
7Oct 12, 2026 20:3523,852125,773,498115,818,0001,061,00020,480
8Oct 12, 2026 20:3523,853125,746,917115,777,0001,104,00020,480
9Oct 12, 2026 20:3523,885125,909,146116,035,0001,006,00020,480