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 14:00Kevin HeaveyKevin HeaveyScore: 52,569Success
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 14:2452,301266,373,646250,254,0006,023,00020,480
2Jul 27, 2026 14:2452,374266,737,130250,156,0006,478,0002,113,536
3Jul 27, 2026 14:2452,395266,758,269250,157,0006,583,00020,480
4Jul 27, 2026 14:2452,543267,588,729250,298,0007,167,00020,480
5Jul 27, 2026 14:2452,569267,716,068250,170,0007,421,00020,480
6Jul 27, 2026 14:2452,671268,275,445250,035,0008,056,00020,480
7Jul 27, 2026 14:2452,744268,878,578250,311,0008,136,00020,480
8Jul 27, 2026 14:2452,933269,761,058250,071,0009,302,00020,480
9Jul 27, 2026 14:2453,105281,372,908250,257,0009,962,00020,480