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 29, 2026 01:21Josu San MartinJosu San MartinScore: 24,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:2124,478129,773,355118,683,0001,260,0002,113,536
2Aug 29, 2026 01:2124,482128,361,752118,719,0001,246,0002,113,536
3Aug 29, 2026 01:2124,483128,401,542118,724,0001,247,0002,113,536
4Aug 29, 2026 01:2124,483128,390,047118,711,0001,256,0002,113,536
5Aug 29, 2026 01:2124,489128,366,343118,745,0001,255,0002,113,536
6Aug 29, 2026 01:2124,498128,444,770118,777,0001,268,0002,113,536
7Aug 29, 2026 01:2124,503129,006,963118,796,0001,272,0002,113,536
8Aug 29, 2026 01:2124,820130,082,849120,366,0001,254,0002,113,536
9Aug 29, 2026 01:2125,609134,022,428124,237,0001,250,0002,113,536