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 listAug 3, 2026 19:22Josu San MartinJosu San MartinScore: 28,006Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 19:2327,922145,230,680135,568,0001,250,0002,113,536
2Aug 3, 2026 19:2327,928145,912,365135,589,0001,262,0002,113,536
3Aug 3, 2026 19:2327,986146,305,405135,858,0001,275,0002,113,536
4Aug 3, 2026 19:2327,996145,638,308135,925,0001,258,0002,113,536
5Aug 3, 2026 19:2328,006145,722,816135,984,0001,247,0002,113,536
6Aug 3, 2026 19:2328,025145,767,876136,049,0001,277,0002,113,536
7Aug 3, 2026 19:2328,036146,418,535136,108,0001,273,0002,113,536
8Aug 3, 2026 19:2328,037145,602,746136,123,0001,263,0002,113,536
9Aug 3, 2026 19:2328,127145,967,452136,678,0001,148,0002,113,536