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 2, 2026 13:54Josu San MartinJosu San MartinScore: 35,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 13:5534,984181,452,205170,291,0001,131,0002,113,536
2Aug 2, 2026 13:5534,988182,286,155170,321,0001,122,0002,113,536
3Aug 2, 2026 13:5534,993181,631,632170,341,0001,128,0002,113,536
4Aug 2, 2026 13:5534,997181,497,353170,359,0001,129,0002,113,536
5Aug 2, 2026 13:5535,002182,373,854170,387,0001,125,0002,113,536
6Aug 2, 2026 13:5535,003182,307,604170,396,0001,123,0002,113,536
7Aug 2, 2026 13:5535,008181,587,132170,417,0001,124,0002,113,536
8Aug 2, 2026 13:5535,016181,514,458170,261,0001,318,0002,113,536
9Aug 2, 2026 13:5535,065182,640,465170,700,0001,120,0002,113,536