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 1, 2026 05:59Josu San MartinJosu San MartinScore: 36,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 05:5936,725190,121,941178,836,0001,117,0002,113,536
2Aug 1, 2026 05:5936,726190,067,454178,851,0001,108,0002,113,536
3Aug 1, 2026 05:5936,732190,926,377178,846,0001,145,0002,113,536
4Aug 1, 2026 05:5936,733190,081,296178,876,0001,120,0002,113,536
5Aug 1, 2026 05:5936,734190,134,972178,872,0001,125,0002,113,536
6Aug 1, 2026 05:5936,736190,185,472178,863,0001,145,0002,113,536
7Aug 1, 2026 05:5936,737190,927,856178,898,0001,117,0002,113,536
8Aug 1, 2026 05:5936,742190,285,028178,912,0001,124,0002,113,536
9Aug 1, 2026 05:5937,134192,863,875180,822,0001,139,0002,113,536