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 10:41Josu San MartinJosu San MartinScore: 26,264Success
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 10:4126,190136,716,102127,082,0001,252,0002,113,536
2Aug 4, 2026 10:4126,223139,345,424127,239,0001,255,0002,113,536
3Aug 4, 2026 10:4126,230137,567,218127,267,0001,263,0002,113,536
4Aug 4, 2026 10:4126,240137,721,274127,304,0001,273,0002,113,536
5Aug 4, 2026 10:4126,264137,089,270127,441,0001,255,0002,113,536
6Aug 4, 2026 10:4126,322137,372,436127,727,0001,254,0002,113,536
7Aug 4, 2026 10:4126,400137,853,617128,314,0001,049,0002,113,536
8Aug 4, 2026 10:4126,451137,926,184128,355,0001,256,0002,113,536
9Aug 4, 2026 10:4126,522138,355,656128,695,0001,265,0002,113,536