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 listJun 19, 2026 06:30Victor MerckléVictor MerckléScore: 33,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 06:3033,746287,683,512279,057,0001,041,0002,113,536
2Jun 19, 2026 06:3033,749287,652,947279,067,0001,055,0002,113,536
3Jun 19, 2026 06:3033,753287,766,205279,103,0001,053,0002,113,536
4Jun 19, 2026 06:3033,754287,637,177279,120,0001,046,0002,113,536
5Jun 19, 2026 06:3033,755287,607,764279,131,0001,040,0002,113,536
6Jun 19, 2026 06:3033,759287,920,924279,156,0001,048,0002,113,536
7Jun 19, 2026 06:3033,769287,824,803279,235,0001,051,0002,113,536
8Jun 19, 2026 06:3033,772287,859,170279,270,0001,045,0002,113,536
9Jun 19, 2026 06:3033,862288,648,611280,050,0001,011,0002,113,536