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 17:50Tomislav TunkovicTomislav TunkovicScore: 33,084Success
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 17:5231,852165,212,945155,065,0001,014,00020,480
2Aug 15, 2026 17:5231,872164,673,073154,155,0002,019,00020,480
3Aug 15, 2026 17:5231,884165,356,355155,225,0001,010,00020,480
4Aug 15, 2026 17:5231,990166,437,525155,740,0001,012,00020,480
5Aug 15, 2026 17:5233,084171,152,355161,101,0001,012,00020,480
6Aug 15, 2026 17:5233,425172,840,658162,774,0001,013,00020,480
7Aug 15, 2026 17:5233,686174,190,257164,052,0001,012,00020,480
8Aug 15, 2026 17:5234,414177,004,305167,625,0001,007,00020,480
9Aug 15, 2026 17:5235,301182,832,262171,972,0001,007,00020,480