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 27, 2026 12:45Kevin HeaveyKevin HeaveyScore: 57,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 12:5257,189290,238,482267,732,00012,496,00020,480
2Jul 27, 2026 12:5257,311291,657,298269,844,00010,983,00020,480
3Jul 27, 2026 12:5257,377291,461,014269,777,00011,371,00020,480
4Jul 27, 2026 12:5257,517291,955,192269,123,00012,715,00020,480
5Jul 27, 2026 12:5257,570292,872,251268,814,00013,280,0002,113,536
6Jul 27, 2026 12:5257,687293,471,116269,510,00013,160,00020,480
7Jul 27, 2026 12:5257,775293,065,608269,782,00013,317,0002,113,536
8Jul 27, 2026 12:5258,549297,632,153273,059,00013,833,0002,113,536
9Jul 27, 2026 12:5260,662308,010,980285,755,00011,492,0002,113,536