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 14:47Josu San MartinJosu San MartinScore: 32,920Success
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 14:4732,874171,176,941159,971,0001,116,0002,113,536
2Aug 2, 2026 14:4732,891171,265,478160,038,0001,131,0002,113,536
3Aug 2, 2026 14:4732,894171,165,276160,064,0001,117,0002,113,536
4Aug 2, 2026 14:4732,917171,258,012160,171,0001,123,0002,113,536
5Aug 2, 2026 14:4732,920171,262,016160,205,0001,104,0002,113,536
6Aug 2, 2026 14:4732,922172,162,538160,175,0001,146,0002,113,536
7Aug 2, 2026 14:4732,944171,452,909160,309,0001,121,0002,113,536
8Aug 2, 2026 14:4732,953171,957,584160,351,0001,120,0002,113,536
9Aug 2, 2026 14:4733,130172,405,226161,221,0001,119,0002,113,536