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 31, 2026 21:49anboto1anboto1Score: 127,036Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 21:50126,464629,942,784618,298,0001,380,0002,113,536
2Jul 31, 2026 21:50126,486629,998,222618,424,0001,358,0002,113,536
3Jul 31, 2026 21:50126,577630,565,781618,869,0001,362,0002,113,536
4Jul 31, 2026 21:50126,943632,214,004620,651,0001,373,0002,113,536
5Jul 31, 2026 21:50127,036632,808,807621,072,0001,407,0002,113,536
6Jul 31, 2026 21:50127,283634,017,451622,308,0001,379,0002,113,536
7Jul 31, 2026 21:50128,253638,653,532627,076,0001,367,0002,113,536
8Jul 31, 2026 21:50128,326639,032,018627,430,0001,371,0002,113,536
9Jul 31, 2026 21:50128,698640,855,909629,240,0001,382,0002,113,536