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 3, 2026 01:49Josu San MartinJosu San MartinScore: 29,375Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 01:4929,327152,777,877142,433,0001,272,0002,113,536
2Aug 3, 2026 01:4929,338152,831,470142,752,0001,006,0002,113,536
3Aug 3, 2026 01:4929,341152,890,654142,753,0001,020,0002,113,536
4Aug 3, 2026 01:4929,364153,078,338142,625,0001,262,0002,113,536
5Aug 3, 2026 01:4929,375153,043,852142,900,0001,038,0002,113,536
6Aug 3, 2026 01:4929,435153,353,230142,980,0001,255,0002,113,536
7Aug 3, 2026 01:4929,452153,331,012143,049,0001,269,0002,113,536
8Aug 3, 2026 01:4929,610154,200,423143,814,0001,276,0002,113,536
9Aug 3, 2026 01:4931,882165,353,566154,960,0001,262,0002,113,536