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 05:10Josu San MartinJosu San MartinScore: 28,784Success
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 05:1028,718149,787,728139,465,0001,258,0002,113,536
2Aug 4, 2026 05:1028,735148,995,481139,774,0001,028,0002,113,536
3Aug 4, 2026 05:1028,738149,997,773139,551,0001,269,0002,113,536
4Aug 4, 2026 05:1028,746149,285,758139,600,0001,260,0002,113,536
5Aug 4, 2026 05:1028,784149,296,391140,040,0001,002,0002,113,536
6Aug 4, 2026 05:1028,790149,512,414140,022,0001,051,0002,113,536
7Aug 4, 2026 05:1028,793150,165,967140,023,0001,066,0002,113,536
8Aug 4, 2026 05:1028,811149,504,164140,138,0001,038,0002,113,536
9Aug 4, 2026 05:1029,172151,332,582141,688,0001,255,0002,113,536