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 10, 2026 12:39Victor MerckléVictor MerckléScore: 4,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 12:404,51945,009,05936,420,0001,092,0002,113,536
2Jun 10, 2026 12:404,53045,195,41736,525,0001,082,0002,113,536
3Jun 10, 2026 12:404,53245,207,82536,617,0001,005,0002,113,536
4Jun 10, 2026 12:404,53445,252,00036,632,0001,005,0002,113,536
5Jun 10, 2026 12:404,53646,451,34336,648,0001,009,0002,113,536
6Jun 10, 2026 12:404,55545,455,98736,731,0001,077,0002,113,536
7Jun 10, 2026 12:404,59845,715,48737,112,0001,053,0002,113,536
8Jun 10, 2026 12:404,61445,910,30837,211,0001,086,0002,113,536
9Jun 10, 2026 12:404,76547,192,77638,538,0001,013,0002,113,536