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 20:31Kevin HeaveyKevin HeaveyScore: 25,560Success
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 20:3125,510133,741,709123,948,0001,055,00020,480
2Sep 23, 2026 20:3125,518133,850,952123,985,0001,058,00020,480
3Sep 23, 2026 20:3125,539133,939,939124,097,0001,047,00020,480
4Sep 23, 2026 20:3125,556133,989,238124,182,0001,045,00020,480
5Sep 23, 2026 20:3125,560134,020,492124,203,0001,043,00020,480
6Sep 23, 2026 20:3125,568134,063,131124,223,0001,065,00020,480
7Sep 23, 2026 20:3125,571134,171,633124,184,0001,116,00020,480
8Sep 23, 2026 20:3125,581133,942,986124,246,0001,104,00020,480
9Sep 23, 2026 20:3125,702134,719,778124,828,0001,115,00020,480