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 9, 2026 09:36Victor MerckléVictor MerckléScore: 34,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 09:3634,720179,590,582169,124,0001,007,0002,117,632stderr
2Jul 9, 2026 09:3634,720178,050,764169,123,0001,006,0002,117,632stderr
3Jul 9, 2026 09:3634,757178,168,614169,305,0001,008,0002,117,632stderr
4Jul 9, 2026 09:3634,761178,678,179169,326,0001,006,0002,117,632stderr
5Jul 9, 2026 09:3634,845178,917,793169,736,0001,006,0002,117,632stderr
6Jul 9, 2026 09:3634,913178,907,022170,070,0001,006,0002,117,632stderr
7Jul 9, 2026 09:3634,982179,283,974170,409,0001,007,0002,117,632stderr
8Jul 9, 2026 09:3635,360181,190,365172,260,0001,007,0002,117,632stderr
9Jul 9, 2026 09:3635,400181,397,155172,457,0001,007,0002,117,632stderr