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 listMar 20, 2026 11:57Dominique GarmierDominique GarmierScore: 9,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 11:579,010106,748,80372,790,0001,994,0002,289,664
2Mar 20, 2026 11:519,021104,406,91673,879,000998,0002,289,664
3Mar 20, 2026 11:519,02999,031,22473,940,000999,0002,408,448
4Mar 20, 2026 11:519,135102,512,59773,822,0001,995,0002,408,448
5Mar 20, 2026 11:579,135104,898,85272,825,0002,992,0002,289,664
6Mar 20, 2026 11:579,289101,764,13574,093,0003,003,0002,408,448