Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJul 31, 2026 13:19George SeabridgeGeorge SeabridgeScore: 100,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 13:2097,143816,353,897805,225,0001,063,0002,117,632
2Jul 31, 2026 13:2098,855830,563,387819,354,0001,150,0002,117,632
3Jul 31, 2026 13:20100,011840,015,779829,031,0001,061,0002,117,632
4Jul 31, 2026 13:20100,324842,681,393831,547,0001,143,0002,117,632
5Jul 31, 2026 13:20100,325842,713,598831,479,0001,220,0002,117,632
6Jul 31, 2026 13:20100,355842,926,245831,809,0001,139,0002,117,632
7Jul 31, 2026 13:20100,397844,535,233832,233,0001,069,0002,117,632
8Jul 31, 2026 13:20100,433843,588,917832,355,0001,245,0002,117,632
9Jul 31, 2026 13:20100,441843,698,408832,463,0001,199,0002,117,632