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 1, 2026 09:19Josu San MartinJosu San MartinScore: 35,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 09:2035,307183,208,508171,882,0001,123,0002,113,536
2Aug 1, 2026 09:2035,307183,200,761171,898,0001,110,0002,113,536
3Aug 1, 2026 09:2035,309183,162,391171,898,0001,117,0002,113,536
4Aug 1, 2026 09:2035,310183,131,348171,896,0001,124,0002,113,536
5Aug 1, 2026 09:2035,312183,235,625171,920,0001,109,0002,113,536
6Aug 1, 2026 09:2035,314183,152,279171,923,0001,119,0002,113,536
7Aug 1, 2026 09:2035,314183,154,469171,931,0001,112,0002,113,536
8Aug 1, 2026 09:2035,323183,187,389171,970,0001,116,0002,113,536
9Aug 1, 2026 09:2035,333184,642,033172,031,0001,105,0002,113,536