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 listJul 2, 2026 08:28A_ShamanA_ShamanScore: 192,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 08:29192,128951,482,560939,415,0002,016,0002,113,536
2Jul 2, 2026 08:29192,193951,405,036939,656,0002,090,0002,113,536
3Jul 2, 2026 08:29192,204951,892,678939,663,0002,140,0002,113,536
4Jul 2, 2026 08:29192,240952,028,492939,871,0002,109,0002,113,536
5Jul 2, 2026 08:29192,265951,761,353939,991,0002,109,0002,113,536
6Jul 2, 2026 08:29192,276951,775,307940,066,0002,088,0002,113,536
7Jul 2, 2026 08:29192,290952,340,603940,091,0002,132,0002,113,536
8Jul 2, 2026 08:29192,300952,076,957940,264,0002,006,0002,113,536
9Jul 2, 2026 08:29192,335954,141,714940,386,0002,058,0002,113,536