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 02:48Josu San MartinJosu San MartinScore: 27,170Success
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 02:4927,097141,161,643131,517,0001,263,0002,113,536
2Aug 4, 2026 02:4927,104141,094,871131,554,0001,259,0002,113,536
3Aug 4, 2026 02:4927,154141,523,800132,040,0001,016,0002,113,536
4Aug 4, 2026 02:4927,163141,878,331131,846,0001,257,0002,113,536
5Aug 4, 2026 02:4927,170142,244,976132,101,0001,033,0002,113,536
6Aug 4, 2026 02:4927,187141,642,911131,967,0001,254,0002,113,536
7Aug 4, 2026 02:4927,224141,823,986132,361,0001,039,0002,113,536
8Aug 4, 2026 02:4927,412142,738,012133,067,0001,256,0002,113,536
9Aug 4, 2026 02:4929,007150,556,658141,058,0001,078,0002,113,536