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 13, 2026 12:47Dominique GarmierDominique GarmierScore: 24,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 12:4724,810231,767,979203,923,0001,999,0002,289,664
2Mar 13, 2026 12:4724,813239,884,772203,946,0001,999,0002,289,664
3Mar 13, 2026 12:4724,819230,740,248203,997,0001,999,0002,265,088
4Mar 13, 2026 12:4724,823229,324,810204,032,0002,000,0002,289,664
5Mar 13, 2026 12:4724,838231,021,574206,158,00002,285,568
6Mar 13, 2026 12:4724,844233,673,946204,204,0002,002,0002,289,664
7Mar 13, 2026 12:4724,849232,769,080206,244,00002,289,664
8Mar 13, 2026 12:4724,871235,574,340205,424,0001,002,0002,289,664
9Mar 13, 2026 12:4724,890238,953,841204,588,0001,995,0002,289,664