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 15, 2026 04:30Victor MerckléVictor MerckléScore: 18,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 04:3218,178158,991,716149,832,0001,047,0002,117,632stderr
2Jul 15, 2026 04:3218,271159,835,808150,626,0001,031,0002,117,632stderr
3Jul 15, 2026 04:3218,284160,365,247150,717,0001,047,0002,117,632stderr
4Jul 15, 2026 04:3218,354160,502,880151,332,0001,009,0002,117,632stderr
5Jul 15, 2026 04:3218,379160,747,148151,493,0001,054,0002,117,632stderr
6Jul 15, 2026 04:3218,390160,789,166151,597,0001,040,0002,117,632stderr
7Jul 15, 2026 04:3218,491161,656,830152,476,0001,003,0002,117,632stderr
8Jul 15, 2026 04:3218,497161,685,086152,458,0001,068,0002,117,632stderr
9Jul 15, 2026 04:3218,747163,740,616154,597,0001,007,0002,117,632stderr