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 21:10Josu San MartinJosu San MartinScore: 34,465Success
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 21:1134,184175,904,279166,321,0001,184,0002,113,536
2Aug 4, 2026 21:1134,330176,743,246167,039,0001,180,0002,113,536
3Aug 4, 2026 21:1134,425177,163,903167,679,0001,007,0002,113,536
4Aug 4, 2026 21:1134,448177,197,740167,619,0001,180,0002,113,536
5Aug 4, 2026 21:1134,465177,347,076167,871,0001,012,0002,113,536
6Aug 4, 2026 21:1134,474177,314,054167,748,0001,178,0002,113,536
7Aug 4, 2026 21:1134,525177,320,509168,152,0001,021,0002,113,536
8Aug 4, 2026 21:1134,554177,847,104168,311,0001,005,0002,113,536
9Aug 4, 2026 21:1134,590177,967,393168,305,0001,187,0002,113,536