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 listJan 17, 2026 16:47Josu San MartinJosu San MartinScore: 120,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2026 16:47119,914615,112,171583,583,0003,997,0002,281,472
2Jan 17, 2026 16:47119,920616,139,698583,610,0003,997,0002,473,984
3Jan 17, 2026 16:47119,972616,526,114582,866,0004,998,0002,400,256
4Jan 17, 2026 16:47120,019615,350,619582,093,0006,000,0002,457,600
5Jan 17, 2026 16:47120,608621,218,436586,982,0003,999,0002,461,696
6Jan 17, 2026 16:47120,639620,729,830587,130,0004,000,0002,437,120
7Jan 17, 2026 16:47120,751621,089,925589,680,0001,998,0002,281,472
8Jan 17, 2026 16:47120,757621,744,102588,712,0002,998,0002,453,504
9Jan 17, 2026 16:47120,966620,298,852588,734,0003,998,0002,289,664