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 19:30anboto1anboto1Score: 163,653Success
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 19:30163,336810,414,130798,949,0001,398,0002,113,536
2Jul 31, 2026 19:30163,370810,511,693799,189,0001,327,0002,113,536
3Jul 31, 2026 19:30163,569811,467,014800,176,0001,316,0002,113,536
4Jul 31, 2026 19:30163,630812,377,809800,431,0001,359,0002,113,536
5Jul 31, 2026 19:30163,653811,853,025800,571,0001,333,0002,113,536
6Jul 31, 2026 19:30163,654812,589,423800,572,0001,334,0002,113,536
7Jul 31, 2026 19:30163,813812,853,114801,369,0001,316,0002,113,536
8Jul 31, 2026 19:30163,896813,298,414801,780,0001,315,0002,113,536
9Jul 31, 2026 19:30164,151814,317,523803,021,0001,319,0002,113,536