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 28, 2026 10:28Kevin HeaveyKevin HeaveyScore: 50,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2026 10:3250,674259,079,672226,433,00021,871,00020,480
2Jul 28, 2026 10:3250,761258,753,276226,532,00022,198,0002,113,536
3Jul 28, 2026 10:3250,783258,821,217226,393,00022,447,00020,480
4Jul 28, 2026 10:3250,801259,591,589226,569,00022,356,00020,480
5Jul 28, 2026 10:3250,857259,279,600226,475,00022,728,0002,113,536
6Jul 28, 2026 10:3251,046260,365,809226,463,00023,666,00020,480
7Jul 28, 2026 10:3255,001279,561,043226,558,00042,949,00020,480
8Jul 28, 2026 10:3255,103280,153,510226,594,00043,413,00020,480
9Jul 28, 2026 10:3256,541287,014,272226,779,00050,274,00020,480