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 2, 2026 17:14Josu San MartinJosu San MartinScore: 30,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:1530,408159,116,947147,896,0001,106,0002,113,536
2Aug 2, 2026 17:1530,414159,094,944147,898,0001,134,0002,113,536
3Aug 2, 2026 17:1530,417159,152,508147,919,0001,128,0002,113,536
4Aug 2, 2026 17:1530,432159,101,418147,999,0001,122,0002,113,536
5Aug 2, 2026 17:1530,436159,227,550148,027,0001,111,0002,113,536
6Aug 2, 2026 17:1530,470160,083,050148,185,0001,120,0002,113,536
7Aug 2, 2026 17:1530,578159,846,074148,723,0001,114,0002,113,536
8Aug 2, 2026 17:1530,586159,973,076148,750,0001,126,0002,113,536
9Aug 2, 2026 17:1533,935176,192,783165,169,0001,113,0002,113,536