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 12:46Josu San MartinJosu San MartinScore: 31,969Success
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 12:4731,793165,627,599154,650,0001,137,0002,113,536
2Aug 2, 2026 12:4731,794165,692,114154,639,0001,152,0002,113,536
3Aug 2, 2026 12:4731,797165,690,780154,673,0001,137,0002,113,536
4Aug 2, 2026 12:4731,816165,679,935154,770,0001,132,0002,113,536
5Aug 2, 2026 12:4731,969166,587,887155,511,0001,138,0002,113,536
6Aug 2, 2026 12:4731,974166,492,070155,539,0001,138,0002,113,536
7Aug 2, 2026 12:4732,010166,661,511155,701,0001,152,0002,113,536
8Aug 2, 2026 12:4732,118167,116,395156,258,0001,122,0002,113,536
9Aug 2, 2026 12:4732,251167,951,636156,886,0001,146,0002,113,536