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 4, 2026 11:48Josu San MartinJosu San MartinScore: 26,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 11:4926,562138,605,396129,147,0001,008,0002,113,536
2Aug 4, 2026 11:4926,575138,455,434129,210,0001,010,0002,113,536
3Aug 4, 2026 11:4926,576139,559,556129,175,0001,048,0002,113,536
4Aug 4, 2026 11:4926,582138,762,994128,984,0001,269,0002,113,536
5Aug 4, 2026 11:4926,583138,715,365128,988,0001,269,0002,113,536
6Aug 4, 2026 11:4926,602138,703,974129,339,0001,012,0002,113,536
7Aug 4, 2026 11:4926,631138,949,249129,224,0001,268,0002,113,536
8Aug 4, 2026 11:4926,637139,999,353129,458,0001,068,0002,113,536
9Aug 4, 2026 11:4926,909140,280,745130,596,0001,261,0002,113,536