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 29, 2026 01:12Josu San MartinJosu San MartinScore: 24,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:1424,362127,811,693118,119,0001,255,0002,113,536
2Aug 29, 2026 01:1424,366128,452,580118,134,0001,261,0002,113,536
3Aug 29, 2026 01:1424,367127,836,989118,142,0001,260,0002,113,536
4Aug 29, 2026 01:1424,368127,773,454118,155,0001,250,0002,113,536
5Aug 29, 2026 01:1424,370128,364,369118,162,0001,252,0002,113,536
6Aug 29, 2026 01:1424,370128,389,372118,145,0001,268,0002,113,536
7Aug 29, 2026 01:1424,370128,404,997118,150,0001,265,0002,113,536
8Aug 29, 2026 01:1424,375128,373,727118,183,0001,257,0002,113,536
9Aug 29, 2026 01:1424,375127,807,506118,192,0001,250,0002,113,536