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 18, 2026 01:24Josu San MartinJosu San MartinScore: 25,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 01:3125,082131,052,716121,644,0001,259,0002,113,536
2Aug 18, 2026 01:3125,100131,187,845121,742,0001,250,0002,113,536
3Aug 18, 2026 01:3125,146131,405,232121,949,0001,267,0002,113,536
4Aug 18, 2026 01:3125,169131,356,870122,057,0001,273,0002,113,536
5Aug 18, 2026 01:3125,177131,521,666122,117,0001,251,0002,113,536
6Aug 18, 2026 01:3125,191131,620,368122,276,0001,160,0002,113,536
7Aug 18, 2026 01:3125,195131,626,147122,256,0001,201,0002,113,536
8Aug 18, 2026 01:3125,232131,828,575122,442,0001,199,0002,113,536
9Aug 18, 2026 01:3125,490134,538,750123,706,0001,199,0002,113,536