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 22:49Josu San MartinJosu San MartinScore: 29,718Success
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 22:4929,687155,458,981144,341,0001,130,0002,113,536
2Aug 2, 2026 22:4929,699155,580,943144,413,0001,116,0002,113,536
3Aug 2, 2026 22:4929,701156,242,562144,416,0001,121,0002,113,536
4Aug 2, 2026 22:4929,714155,556,836144,490,0001,109,0002,113,536
5Aug 2, 2026 22:4929,718156,402,694144,493,0001,128,0002,113,536
6Aug 2, 2026 22:4929,719156,375,603144,502,0001,123,0002,113,536
7Aug 2, 2026 22:4929,720155,587,156144,507,0001,124,0002,113,536
8Aug 2, 2026 22:4930,128157,744,619146,496,0001,133,0002,113,536
9Aug 2, 2026 22:4931,928166,497,489155,321,0001,131,0002,113,536