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 16:34Josu San MartinJosu San MartinScore: 25,668Success
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 16:3425,610133,939,942124,224,0001,268,0002,113,536
2Aug 4, 2026 16:3425,617133,910,761124,266,0001,260,0002,113,536
3Aug 4, 2026 16:3425,626134,569,288124,316,0001,254,0002,113,536
4Aug 4, 2026 16:3425,631134,636,307124,577,0001,015,0002,113,536
5Aug 4, 2026 16:3425,668134,228,362124,503,0001,273,0002,113,536
6Aug 4, 2026 16:3425,692135,015,916124,840,0001,052,0002,113,536
7Aug 4, 2026 16:3425,697134,949,624124,653,0001,264,0002,113,536
8Aug 4, 2026 16:3425,916136,067,087125,966,0001,026,0002,113,536
9Aug 4, 2026 16:3426,800141,946,027130,061,0001,260,0002,113,536