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 listSep 23, 2026 22:30Kevin HeaveyKevin HeaveyScore: 24,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 22:3024,469128,620,970118,843,0001,058,00020,480
2Sep 23, 2026 22:3024,478128,852,056118,885,0001,062,00020,480
3Sep 23, 2026 22:3024,481128,707,382118,896,0001,065,00020,480
4Sep 23, 2026 22:3024,486128,764,518118,919,0001,066,00020,480
5Sep 23, 2026 22:3024,493128,937,633118,904,0001,116,00020,480
6Sep 23, 2026 22:3024,494128,850,107118,955,0001,069,00020,480
7Sep 23, 2026 22:3024,503128,813,462119,011,0001,054,00020,480
8Sep 23, 2026 22:3024,518128,898,512119,075,0001,064,00020,480
9Sep 23, 2026 22:3024,539129,247,927119,188,0001,054,00020,480