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 3, 2026 16:26Josu San MartinJosu San MartinScore: 30,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 16:2730,123156,681,127146,349,0001,257,0002,113,536
2Aug 3, 2026 16:2730,165156,321,751146,567,0001,242,0002,113,536
3Aug 3, 2026 16:2730,173157,076,005146,600,0001,248,0002,113,536
4Aug 3, 2026 16:2730,222157,295,322146,837,0001,253,0002,113,536
5Aug 3, 2026 16:2730,276157,439,041147,095,0001,262,0002,113,536
6Aug 3, 2026 16:2730,285157,459,662147,345,0001,052,0002,113,536
7Aug 3, 2026 16:2730,307157,618,848147,228,0001,280,0002,113,536
8Aug 3, 2026 16:2730,652163,949,598148,938,0001,259,0002,113,536
9Aug 3, 2026 16:2730,719159,454,342149,276,0001,251,0002,113,536