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 listOct 12, 2026 14:41highload-churnerhighload-churnerScore: 23,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 14:4223,656124,799,691114,829,0001,087,0002,113,536
2Oct 12, 2026 14:4223,657124,827,405114,817,0001,104,0002,113,536
3Oct 12, 2026 14:4223,664124,944,067114,939,0001,018,0002,113,536
4Oct 12, 2026 14:4223,670125,006,129114,858,0001,125,0002,113,536
5Oct 12, 2026 14:4223,682125,219,588114,834,0001,210,0002,113,536
6Oct 12, 2026 14:4223,688124,982,210114,813,0001,262,0002,113,536
7Oct 12, 2026 14:4223,691125,068,804114,826,0001,264,0002,113,536
8Oct 12, 2026 14:4223,715125,235,737115,094,0001,114,0002,113,536
9Oct 12, 2026 14:4223,760125,424,894115,396,0001,032,0002,113,536