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 4, 2026 08:48Josu San MartinJosu San MartinScore: 26,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 08:4826,464138,824,988128,413,0001,263,0002,113,536
2Aug 4, 2026 08:4826,487138,878,623128,520,0001,269,0002,113,536
3Aug 4, 2026 08:4826,512139,554,895128,654,0001,258,0002,113,536
4Aug 4, 2026 08:4826,527138,422,437128,728,0001,258,0002,113,536
5Aug 4, 2026 08:4826,549138,630,180129,063,0001,029,0002,113,536
6Aug 4, 2026 08:4826,561138,600,244129,117,0001,034,0002,113,536
7Aug 4, 2026 08:4826,793140,286,245130,037,0001,252,0002,113,536
8Aug 4, 2026 08:4826,894140,258,735130,516,0001,265,0002,113,536
9Aug 4, 2026 08:4827,025140,518,397131,167,0001,256,0002,113,536