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:27Josu San MartinJosu San MartinScore: 38,619Success
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:2738,603199,877,482188,038,0001,118,0002,113,536
2Jul 31, 2026 21:2738,608200,100,534188,068,0001,114,0002,113,536
3Jul 31, 2026 21:2738,612199,307,055188,069,0001,133,0002,113,536
4Jul 31, 2026 21:2738,613199,390,400188,087,0001,121,0002,113,536
5Jul 31, 2026 21:2738,619200,158,038188,110,0001,126,0002,113,536
6Jul 31, 2026 21:2738,624199,489,731188,139,0001,123,0002,113,536
7Jul 31, 2026 21:2738,631200,254,188188,158,0001,135,0002,113,536
8Jul 31, 2026 21:2738,800201,033,601188,980,0001,142,0002,113,536
9Jul 31, 2026 21:2739,068201,412,745190,338,0001,097,0002,113,536