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 11, 2026 01:38Victor MerckléVictor MerckléScore: 6,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 01:396,34660,277,53651,476,0001,203,0002,113,536
2Jun 11, 2026 01:396,38460,558,92651,737,0001,254,0002,113,536
3Jun 11, 2026 01:396,39860,829,85251,842,0001,267,0002,113,536
4Jun 11, 2026 01:396,45761,284,13252,341,0001,253,0002,113,536
5Jun 11, 2026 01:396,58662,254,03753,408,0001,258,0002,113,536
6Jun 11, 2026 01:396,60462,382,37753,541,0001,273,0002,113,536
7Jun 11, 2026 01:396,68663,050,26654,249,0001,252,0002,113,536
8Jun 11, 2026 01:396,72163,583,56354,521,0001,271,0002,113,536
9Jun 11, 2026 01:396,81063,948,84055,280,0001,250,0002,113,536