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 09:10Josu San MartinJosu San MartinScore: 26,168Success
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 09:1126,104136,314,896126,654,0001,258,0002,113,536
2Aug 4, 2026 09:1126,109140,219,975126,673,0001,264,0002,113,536
3Aug 4, 2026 09:1126,115136,403,049126,708,0001,260,0002,113,536
4Aug 4, 2026 09:1126,142136,671,921126,840,0001,258,0002,113,536
5Aug 4, 2026 09:1126,168136,781,600127,177,0001,049,0002,113,536
6Aug 4, 2026 09:1126,176136,673,281127,006,0001,258,0002,113,536
7Aug 4, 2026 09:1126,205136,850,667127,145,0001,264,0002,113,536
8Aug 4, 2026 09:1126,416137,879,896128,249,0001,190,0002,113,536
9Aug 4, 2026 09:1131,128162,053,751151,261,0001,269,0002,113,536