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 listAug 15, 2026 22:08Tomislav TunkovicTomislav TunkovicScore: 31,255Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 22:1130,837159,633,958150,095,0001,010,00020,480
2Aug 15, 2026 22:1130,901159,880,042150,409,0001,010,00020,480
3Aug 15, 2026 22:1130,902159,879,650150,409,0001,011,00020,480
4Aug 15, 2026 22:1130,931160,698,660149,541,0002,023,00020,480
5Aug 15, 2026 22:1131,255161,628,694152,142,0001,010,00020,480
6Aug 15, 2026 22:1131,396162,931,413152,832,0001,012,00020,480
7Aug 15, 2026 22:1133,163172,297,535161,492,0001,011,00020,480
8Aug 15, 2026 22:1133,189171,784,357161,616,0001,014,00020,480
9Aug 15, 2026 22:1147,557242,199,835232,025,0001,008,00020,480