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 2, 2026 06:17Josu San MartinJosu San MartinScore: 33,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 06:1733,601174,712,546163,531,0001,114,0002,113,536
2Aug 2, 2026 06:1733,604174,684,106163,543,0001,121,0002,113,536
3Aug 2, 2026 06:1733,616174,736,995163,602,0001,117,0002,113,536
4Aug 2, 2026 06:1733,642174,854,599163,736,0001,111,0002,113,536
5Aug 2, 2026 06:1733,643175,644,050163,722,0001,133,0002,113,536
6Aug 2, 2026 06:1733,766175,545,921164,311,0001,143,0002,113,536
7Aug 2, 2026 06:1733,784175,541,203164,421,0001,122,0002,113,536
8Aug 2, 2026 06:1733,813176,605,242164,543,0001,144,0002,113,536
9Aug 2, 2026 06:1741,664214,208,830203,030,0001,126,0002,113,536