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:45Tomislav TunkovicTomislav TunkovicScore: 33,110Success
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:4831,997166,777,373155,775,0001,011,00020,480
2Aug 15, 2026 17:4832,089165,671,115156,230,0001,010,00020,480
3Aug 15, 2026 17:4832,355168,238,985157,530,0001,010,00020,480
4Aug 15, 2026 17:4832,632168,380,378158,888,0001,009,00020,480
5Aug 15, 2026 17:4833,110171,358,284161,226,0001,014,00020,480
6Aug 15, 2026 17:4833,166171,069,477161,502,0001,013,00020,480
7Aug 15, 2026 17:4833,302172,760,316162,171,0001,012,00020,480
8Aug 15, 2026 17:4835,359182,403,627172,256,0001,006,00020,480
9Aug 15, 2026 17:4854,114273,670,094263,138,0002,022,00020,480