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 24, 2026 20:40Victor MerckléVictor MerckléScore: 49,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:4048,974248,350,409237,948,0002,025,0002,117,632stderr
2Aug 24, 2026 20:4049,118249,801,949238,605,0002,075,0002,117,632stderr
3Aug 24, 2026 20:4049,212249,567,745239,099,0002,042,0002,117,632stderr
4Aug 24, 2026 20:4049,239249,728,972239,177,0002,096,0002,117,632stderr
5Aug 24, 2026 20:4049,265249,858,913239,366,0002,037,0002,117,632stderr
6Aug 24, 2026 20:4049,282249,887,012239,421,0002,061,0002,117,632stderr
7Aug 24, 2026 20:4049,299250,730,176239,499,0002,069,0002,117,632stderr
8Aug 24, 2026 20:4049,605260,223,015241,052,0002,014,0002,117,632stderr
9Aug 24, 2026 20:4049,674251,812,625241,330,0002,077,0002,117,632stderr