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 13:18Josu San MartinJosu San MartinScore: 33,929Success
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 13:1833,892176,249,279164,958,0001,116,0002,113,536
2Aug 2, 2026 13:1833,907176,249,692165,024,0001,125,0002,113,536
3Aug 2, 2026 13:1833,910176,113,317165,047,0001,116,0002,113,536
4Aug 2, 2026 13:1833,918176,282,672165,070,0001,131,0002,113,536
5Aug 2, 2026 13:1833,929176,254,331165,137,0001,116,0002,113,536
6Aug 2, 2026 13:1833,931176,646,925165,126,0001,136,0002,113,536
7Aug 2, 2026 13:1833,932176,379,273165,157,0001,111,0002,113,536
8Aug 2, 2026 13:1833,977176,509,889165,154,0001,335,0002,113,536
9Aug 2, 2026 13:1834,304178,424,964166,945,0001,145,0002,113,536