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 listOct 16, 2025 19:34BenzotoporBenzotoporScore: 50,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2025 19:3450,770448,340,012420,390,0001,000,0002,265,088
2Oct 16, 2025 19:3450,781448,347,942419,484,0001,997,0002,375,680
3Oct 16, 2025 19:3450,784448,649,731419,509,0001,997,0002,285,568
4Oct 16, 2025 19:3450,795448,249,109419,600,0001,998,0002,289,664
5Oct 16, 2025 19:3450,796449,004,560420,611,000999,0002,285,568
6Oct 16, 2025 19:3450,797449,079,407419,617,0001,998,0002,269,184
7Oct 16, 2025 19:3450,798446,573,906419,625,0001,998,0002,277,376
8Oct 16, 2025 19:3450,800447,319,350419,643,0001,998,0002,285,568
9Oct 16, 2025 19:3450,814444,863,865420,754,000999,0002,285,568