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 08:24Josu San MartinJosu San MartinScore: 30,478Success
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 08:2530,164156,223,206146,548,0001,260,0002,113,536
2Aug 4, 2026 08:2530,465157,651,301148,029,0001,254,0002,113,536
3Aug 4, 2026 08:2530,468158,419,129148,038,0001,260,0002,113,536
4Aug 4, 2026 08:2530,474157,832,448148,075,0001,249,0002,113,536
5Aug 4, 2026 08:2530,478157,774,774148,089,0001,254,0002,113,536
6Aug 4, 2026 08:2530,478157,615,823148,334,0001,012,0002,113,536
7Aug 4, 2026 08:2530,531158,435,100148,576,0001,028,0002,113,536
8Aug 4, 2026 08:2530,720158,932,635149,521,0001,007,0002,113,536
9Aug 4, 2026 08:2531,379162,162,393152,730,0001,028,0002,113,536