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 19:59Tomislav TunkovicTomislav TunkovicScore: 31,183Success
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 20:0131,081161,469,027151,282,0001,015,00020,480
2Aug 15, 2026 20:0131,150161,761,029151,624,0001,012,00020,480
3Aug 15, 2026 20:0131,154161,884,334151,646,0001,010,00020,480
4Aug 15, 2026 20:0131,177161,244,737151,758,0001,011,00020,480
5Aug 15, 2026 20:0131,183161,953,799151,788,0001,011,00020,480
6Aug 15, 2026 20:0131,184163,297,810150,778,0002,028,00020,480
7Aug 15, 2026 20:0131,243162,166,108152,083,0001,011,00020,480
8Aug 15, 2026 20:0131,415163,018,827152,922,0001,015,00020,480
9Aug 15, 2026 20:0134,492178,208,856166,939,0002,075,00020,480