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 28, 2026 22:00Josu San MartinJosu San MartinScore: 25,247Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 22:0125,225132,088,521122,342,0001,265,0002,113,536
2Aug 28, 2026 22:0125,239132,732,290122,431,0001,243,0002,113,536
3Aug 28, 2026 22:0125,240132,074,486122,430,0001,246,0002,113,536
4Aug 28, 2026 22:0125,245133,321,088122,455,0001,250,0002,113,536
5Aug 28, 2026 22:0125,247132,751,546122,459,0001,254,0002,113,536
6Aug 28, 2026 22:0125,247132,184,173122,457,0001,255,0002,113,536
7Aug 28, 2026 22:0125,341132,606,073122,927,0001,248,0002,113,536
8Aug 28, 2026 22:0126,050136,675,215126,400,0001,245,0002,113,536
9Aug 28, 2026 22:0126,248136,995,492127,611,0001,007,0002,113,536