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 21:23Josu San MartinJosu San MartinScore: 29,718Success
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 21:2329,707157,551,047144,452,0001,114,0002,113,536
2Aug 2, 2026 21:2329,710156,337,396144,447,0001,134,0002,113,536
3Aug 2, 2026 21:2329,714155,557,130144,472,0001,127,0002,113,536
4Aug 2, 2026 21:2329,714155,538,758144,484,0001,116,0002,113,536
5Aug 2, 2026 21:2329,718155,607,634144,492,0001,128,0002,113,536
6Aug 2, 2026 21:2329,725155,660,249144,524,0001,130,0002,113,536
7Aug 2, 2026 21:2329,732156,489,878144,545,0001,145,0002,113,536
8Aug 2, 2026 21:2329,862165,373,985145,171,0001,154,0002,113,536
9Aug 2, 2026 21:2329,901157,291,766145,373,0001,145,0002,113,536